/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:55:35,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:55:35,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:55:35,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:55:35,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:55:35,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:55:35,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:55:35,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:55:35,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:55:35,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:55:35,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:55:35,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:55:35,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:55:35,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:55:35,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:55:35,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:55:35,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:55:35,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:55:35,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:55:35,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:55:35,945 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:55:35,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:55:35,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:55:35,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:55:35,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:55:35,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:55:35,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:55:35,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:55:35,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:55:35,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:55:35,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:55:35,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:55:35,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:55:35,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:55:35,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:55:35,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:55:35,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:55:35,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:55:35,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:55:35,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:55:35,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:55:35,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:55:35,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:55:35,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:55:35,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:55:35,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:55:35,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:55:35,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:55:35,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:55:35,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:55:35,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:55:35,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:55:35,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:55:35,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:55:35,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:55:35,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:55:35,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:55:35,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:55:35,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:55:35,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:55:35,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:55:35,977 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:55:35,978 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:55:35,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:55:35,978 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:55:35,978 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:55:36,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:55:36,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:55:36,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:55:36,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:55:36,197 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:55:36,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2022-04-08 14:55:36,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3f6e8e6/f3d3d3e62503481a897d0ccff80d2c04/FLAG588571a74 [2022-04-08 14:55:36,634 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:55:36,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-04-08 14:55:36,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3f6e8e6/f3d3d3e62503481a897d0ccff80d2c04/FLAG588571a74 [2022-04-08 14:55:37,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3f6e8e6/f3d3d3e62503481a897d0ccff80d2c04 [2022-04-08 14:55:37,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:55:37,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:55:37,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:55:37,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:55:37,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:55:37,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518afce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37, skipping insertion in model container [2022-04-08 14:55:37,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:55:37,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:55:37,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c[4246,4259] [2022-04-08 14:55:37,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:55:37,241 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:55:37,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c[4246,4259] [2022-04-08 14:55:37,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:55:37,270 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:55:37,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37 WrapperNode [2022-04-08 14:55:37,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:55:37,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:55:37,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:55:37,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:55:37,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:55:37,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:55:37,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:55:37,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:55:37,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (1/1) ... [2022-04-08 14:55:37,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:55:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:55:37,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:55:37,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:55:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:55:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:55:37,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:55:37,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:55:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:55:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:55:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:55:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:55:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:55:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:55:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:55:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:55:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:55:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:55:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:55:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:55:37,454 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:55:37,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:55:37,699 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:55:37,705 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:55:37,706 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:55:37,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:55:37 BoogieIcfgContainer [2022-04-08 14:55:37,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:55:37,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:55:37,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:55:37,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:55:37,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:55:37" (1/3) ... [2022-04-08 14:55:37,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d11d48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:55:37, skipping insertion in model container [2022-04-08 14:55:37,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:55:37" (2/3) ... [2022-04-08 14:55:37,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d11d48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:55:37, skipping insertion in model container [2022-04-08 14:55:37,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:55:37" (3/3) ... [2022-04-08 14:55:37,714 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-04-08 14:55:37,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:55:37,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:55:37,753 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:55:37,761 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:55:37,761 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:55:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:55:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:55:37,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:37,780 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:37,780 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 1 times [2022-04-08 14:55:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:37,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639926888] [2022-04-08 14:55:37,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 2 times [2022-04-08 14:55:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:37,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861752268] [2022-04-08 14:55:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:37,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:38,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-08 14:55:38,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-08 14:55:38,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-08 14:55:38,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:38,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-08 14:55:38,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-08 14:55:38,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-08 14:55:38,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret16 := main(); {51#true} is VALID [2022-04-08 14:55:38,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {51#true} is VALID [2022-04-08 14:55:38,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {51#true} is VALID [2022-04-08 14:55:38,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {51#true} is VALID [2022-04-08 14:55:38,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume 0 != ~p1~0;~lk1~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p1~0; {56#(= main_~lk1~0 1)} is VALID [2022-04-08 14:55:38,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {52#false} is VALID [2022-04-08 14:55:38,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-08 14:55:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:38,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861752268] [2022-04-08 14:55:38,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861752268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:38,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:38,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:38,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:38,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639926888] [2022-04-08 14:55:38,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639926888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:38,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:38,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:38,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212454698] [2022-04-08 14:55:38,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:38,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:55:38,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:38,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:38,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:38,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:38,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:38,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:38,111 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:38,411 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2022-04-08 14:55:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:55:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:55:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-08 14:55:38,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-08 14:55:38,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:38,606 INFO L225 Difference]: With dead ends: 94 [2022-04-08 14:55:38,606 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 14:55:38,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:38,613 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:38,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 95 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:55:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 14:55:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-04-08 14:55:38,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:38,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,651 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,651 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:38,656 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-08 14:55:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-08 14:55:38,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:38,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:38,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-08 14:55:38,657 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-08 14:55:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:38,670 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-08 14:55:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-08 14:55:38,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:38,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:38,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:38,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-04-08 14:55:38,674 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-04-08 14:55:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:38,674 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-04-08 14:55:38,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 98 transitions. [2022-04-08 14:55:38,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-04-08 14:55:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:55:38,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:38,761 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:38,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:55:38,762 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 1 times [2022-04-08 14:55:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:38,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610571067] [2022-04-08 14:55:38,764 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 2 times [2022-04-08 14:55:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:38,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785486105] [2022-04-08 14:55:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:38,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:38,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-08 14:55:38,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-08 14:55:38,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-08 14:55:38,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:38,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-08 14:55:38,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-08 14:55:38,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-08 14:55:38,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret16 := main(); {519#true} is VALID [2022-04-08 14:55:38,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {519#true} is VALID [2022-04-08 14:55:38,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {519#true} is VALID [2022-04-08 14:55:38,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {519#true} is VALID [2022-04-08 14:55:38,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume !(0 != ~p1~0); {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p2~0); {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p10~0); {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-08 14:55:38,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p1~0; {520#false} is VALID [2022-04-08 14:55:38,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {520#false} assume 1 != ~lk1~0; {520#false} is VALID [2022-04-08 14:55:38,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-04-08 14:55:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:38,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785486105] [2022-04-08 14:55:38,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785486105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:38,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:38,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:38,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:38,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610571067] [2022-04-08 14:55:38,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610571067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:38,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:38,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098972701] [2022-04-08 14:55:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:38,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:55:38,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:38,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:38,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:38,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:38,899 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:39,136 INFO L93 Difference]: Finished difference Result 128 states and 233 transitions. [2022-04-08 14:55:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 14:55:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 14:55:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-08 14:55:39,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-08 14:55:39,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:39,288 INFO L225 Difference]: With dead ends: 128 [2022-04-08 14:55:39,288 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 14:55:39,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:39,290 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:39,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 103 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:55:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 14:55:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-08 14:55:39,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:39,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,309 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,310 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:39,312 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-08 14:55:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-08 14:55:39,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:39,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:39,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-08 14:55:39,313 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-08 14:55:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:39,316 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-08 14:55:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-08 14:55:39,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:39,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:39,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:39,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-04-08 14:55:39,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-04-08 14:55:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:39,325 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-04-08 14:55:39,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 138 transitions. [2022-04-08 14:55:39,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-04-08 14:55:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:55:39,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:39,419 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:39,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:55:39,419 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 1 times [2022-04-08 14:55:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:39,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44800457] [2022-04-08 14:55:39,423 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 2 times [2022-04-08 14:55:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:39,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077015386] [2022-04-08 14:55:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:39,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:39,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-08 14:55:39,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-08 14:55:39,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-08 14:55:39,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:39,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-08 14:55:39,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-08 14:55:39,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-08 14:55:39,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret16 := main(); {1099#true} is VALID [2022-04-08 14:55:39,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {1099#true} is VALID [2022-04-08 14:55:39,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1099#true} is VALID [2022-04-08 14:55:39,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1099#true} is VALID [2022-04-08 14:55:39,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume 0 != ~p1~0;~lk1~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-08 14:55:39,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1100#false} is VALID [2022-04-08 14:55:39,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1100#false} assume 0 != ~p2~0; {1100#false} is VALID [2022-04-08 14:55:39,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume 1 != ~lk2~0; {1100#false} is VALID [2022-04-08 14:55:39,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-08 14:55:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:39,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077015386] [2022-04-08 14:55:39,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077015386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:39,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:39,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:39,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:39,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44800457] [2022-04-08 14:55:39,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44800457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:39,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:39,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073569658] [2022-04-08 14:55:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:39,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:55:39,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:39,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:39,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:39,507 INFO L87 Difference]: Start difference. First operand 77 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:39,668 INFO L93 Difference]: Finished difference Result 118 states and 208 transitions. [2022-04-08 14:55:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:55:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 14:55:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-08 14:55:39,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-08 14:55:39,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:39,825 INFO L225 Difference]: With dead ends: 118 [2022-04-08 14:55:39,825 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 14:55:39,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:39,826 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:39,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 14:55:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-08 14:55:39,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:39,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,834 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,834 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:39,836 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-08 14:55:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-08 14:55:39,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:39,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:39,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-08 14:55:39,837 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-08 14:55:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:39,839 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-08 14:55:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-08 14:55:39,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:39,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:39,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:39,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-04-08 14:55:39,842 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-04-08 14:55:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:39,842 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-04-08 14:55:39,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:39,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 140 transitions. [2022-04-08 14:55:39,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-04-08 14:55:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:55:39,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:39,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:39,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:55:39,946 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 1 times [2022-04-08 14:55:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:39,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795664990] [2022-04-08 14:55:39,947 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 2 times [2022-04-08 14:55:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:39,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697573444] [2022-04-08 14:55:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:40,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-08 14:55:40,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-08 14:55:40,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-08 14:55:40,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:40,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-08 14:55:40,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-08 14:55:40,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-08 14:55:40,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret16 := main(); {1671#true} is VALID [2022-04-08 14:55:40,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {1671#true} is VALID [2022-04-08 14:55:40,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1671#true} is VALID [2022-04-08 14:55:40,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1671#true} is VALID [2022-04-08 14:55:40,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#true} assume !(0 != ~p1~0); {1671#true} is VALID [2022-04-08 14:55:40,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#true} assume !(0 != ~p2~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-08 14:55:40,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p2~0; {1672#false} is VALID [2022-04-08 14:55:40,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {1672#false} assume 1 != ~lk2~0; {1672#false} is VALID [2022-04-08 14:55:40,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-08 14:55:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:40,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697573444] [2022-04-08 14:55:40,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697573444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:40,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:40,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:40,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795664990] [2022-04-08 14:55:40,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795664990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:40,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:40,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281949901] [2022-04-08 14:55:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:40,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:55:40,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:40,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:40,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:40,025 INFO L87 Difference]: Start difference. First operand 80 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:40,182 INFO L93 Difference]: Finished difference Result 220 states and 396 transitions. [2022-04-08 14:55:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:40,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:55:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 14:55:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-08 14:55:40,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-08 14:55:40,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:40,330 INFO L225 Difference]: With dead ends: 220 [2022-04-08 14:55:40,330 INFO L226 Difference]: Without dead ends: 149 [2022-04-08 14:55:40,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:40,331 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:40,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-08 14:55:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-04-08 14:55:40,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:40,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,343 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,344 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:40,349 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-08 14:55:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-08 14:55:40,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:40,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:40,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-08 14:55:40,350 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-08 14:55:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:40,355 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-08 14:55:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-08 14:55:40,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:40,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:40,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:40,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 261 transitions. [2022-04-08 14:55:40,361 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 261 transitions. Word has length 23 [2022-04-08 14:55:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:40,361 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 261 transitions. [2022-04-08 14:55:40,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 261 transitions. [2022-04-08 14:55:40,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 261 transitions. [2022-04-08 14:55:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 14:55:40,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:40,554 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:40,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:55:40,555 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 1 times [2022-04-08 14:55:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:40,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708406973] [2022-04-08 14:55:40,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 2 times [2022-04-08 14:55:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:40,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397209125] [2022-04-08 14:55:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:40,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-08 14:55:40,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-08 14:55:40,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-08 14:55:40,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {2715#true} call ULTIMATE.init(); {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:40,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-08 14:55:40,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-08 14:55:40,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-08 14:55:40,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {2715#true} call #t~ret16 := main(); {2715#true} is VALID [2022-04-08 14:55:40,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {2715#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {2715#true} is VALID [2022-04-08 14:55:40,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {2715#true} is VALID [2022-04-08 14:55:40,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {2715#true} is VALID [2022-04-08 14:55:40,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !(0 != ~p1~0); {2715#true} is VALID [2022-04-08 14:55:40,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {2715#true} assume 0 != ~p2~0;~lk2~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2720#(= main_~lk2~0 1)} is VALID [2022-04-08 14:55:40,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {2720#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2716#false} is VALID [2022-04-08 14:55:40,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-04-08 14:55:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:40,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397209125] [2022-04-08 14:55:40,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397209125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:40,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:40,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:40,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:40,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708406973] [2022-04-08 14:55:40,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708406973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:40,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:40,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717021542] [2022-04-08 14:55:40,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:40,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:55:40,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:40,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:40,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:40,631 INFO L87 Difference]: Start difference. First operand 147 states and 261 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:40,802 INFO L93 Difference]: Finished difference Result 191 states and 339 transitions. [2022-04-08 14:55:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 14:55:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 14:55:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 14:55:40,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-08 14:55:40,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:40,892 INFO L225 Difference]: With dead ends: 191 [2022-04-08 14:55:40,893 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 14:55:40,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:40,893 INFO L913 BasicCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:40,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 14:55:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2022-04-08 14:55:40,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:40,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,903 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,904 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:40,908 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-08 14:55:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-08 14:55:40,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:40,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:40,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-08 14:55:40,909 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-08 14:55:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:40,912 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-08 14:55:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-08 14:55:40,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:40,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:40,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:40,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-04-08 14:55:40,916 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-04-08 14:55:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:40,917 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-04-08 14:55:40,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:40,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 259 transitions. [2022-04-08 14:55:41,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-04-08 14:55:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:55:41,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:41,112 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:41,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:55:41,112 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 1 times [2022-04-08 14:55:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:41,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [981585370] [2022-04-08 14:55:41,113 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 2 times [2022-04-08 14:55:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:41,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564554241] [2022-04-08 14:55:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:41,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-08 14:55:41,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-08 14:55:41,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-08 14:55:41,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {3781#true} call ULTIMATE.init(); {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:41,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-08 14:55:41,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-08 14:55:41,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-08 14:55:41,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {3781#true} call #t~ret16 := main(); {3781#true} is VALID [2022-04-08 14:55:41,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {3781#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {3781#true} is VALID [2022-04-08 14:55:41,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {3781#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {3781#true} is VALID [2022-04-08 14:55:41,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {3781#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {3781#true} is VALID [2022-04-08 14:55:41,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {3781#true} assume !(0 != ~p1~0); {3781#true} is VALID [2022-04-08 14:55:41,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {3781#true} assume !(0 != ~p2~0); {3781#true} is VALID [2022-04-08 14:55:41,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {3781#true} assume 0 != ~p3~0;~lk3~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3786#(= main_~lk3~0 1)} is VALID [2022-04-08 14:55:41,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {3786#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3782#false} is VALID [2022-04-08 14:55:41,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {3782#false} assume !false; {3782#false} is VALID [2022-04-08 14:55:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:41,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564554241] [2022-04-08 14:55:41,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564554241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:41,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:41,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:41,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:41,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [981585370] [2022-04-08 14:55:41,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [981585370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:41,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:41,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590552221] [2022-04-08 14:55:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:41,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:55:41,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:41,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:41,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:41,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:41,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:41,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:41,191 INFO L87 Difference]: Start difference. First operand 147 states and 259 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:41,333 INFO L93 Difference]: Finished difference Result 275 states and 491 transitions. [2022-04-08 14:55:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:41,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:55:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 14:55:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-08 14:55:41,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-08 14:55:41,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:41,442 INFO L225 Difference]: With dead ends: 275 [2022-04-08 14:55:41,442 INFO L226 Difference]: Without dead ends: 273 [2022-04-08 14:55:41,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:41,444 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:41,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-08 14:55:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2022-04-08 14:55:41,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:41,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,484 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,485 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:41,490 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-08 14:55:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-08 14:55:41,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:41,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:41,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-08 14:55:41,492 INFO L87 Difference]: Start difference. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-08 14:55:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:41,497 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-08 14:55:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-08 14:55:41,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:41,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:41,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:41,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 349 transitions. [2022-04-08 14:55:41,502 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 349 transitions. Word has length 24 [2022-04-08 14:55:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:41,502 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 349 transitions. [2022-04-08 14:55:41,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 349 transitions. [2022-04-08 14:55:41,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 349 transitions. [2022-04-08 14:55:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:55:41,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:41,783 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:41,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:55:41,784 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 1 times [2022-04-08 14:55:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:41,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873707468] [2022-04-08 14:55:41,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 2 times [2022-04-08 14:55:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:41,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206577317] [2022-04-08 14:55:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:41,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:41,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:41,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-08 14:55:41,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-08 14:55:41,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-08 14:55:41,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:41,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-08 14:55:41,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-08 14:55:41,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-08 14:55:41,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {5287#true} call #t~ret16 := main(); {5287#true} is VALID [2022-04-08 14:55:41,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {5287#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {5287#true} is VALID [2022-04-08 14:55:41,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {5287#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {5287#true} is VALID [2022-04-08 14:55:41,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {5287#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {5287#true} is VALID [2022-04-08 14:55:41,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {5287#true} assume !(0 != ~p1~0); {5287#true} is VALID [2022-04-08 14:55:41,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {5287#true} assume !(0 != ~p2~0); {5287#true} is VALID [2022-04-08 14:55:41,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {5287#true} assume !(0 != ~p3~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-08 14:55:41,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p3~0; {5288#false} is VALID [2022-04-08 14:55:41,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {5288#false} assume 1 != ~lk3~0; {5288#false} is VALID [2022-04-08 14:55:41,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2022-04-08 14:55:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:41,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:41,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206577317] [2022-04-08 14:55:41,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206577317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:41,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:41,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:41,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:41,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873707468] [2022-04-08 14:55:41,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873707468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:41,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:41,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:41,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310040274] [2022-04-08 14:55:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:41,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:55:41,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:41,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:41,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:41,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:41,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:41,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:41,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:41,851 INFO L87 Difference]: Start difference. First operand 199 states and 349 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:42,012 INFO L93 Difference]: Finished difference Result 471 states and 835 transitions. [2022-04-08 14:55:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:42,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 14:55:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 14:55:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-08 14:55:42,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-08 14:55:42,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:42,143 INFO L225 Difference]: With dead ends: 471 [2022-04-08 14:55:42,143 INFO L226 Difference]: Without dead ends: 281 [2022-04-08 14:55:42,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:42,144 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:42,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-08 14:55:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2022-04-08 14:55:42,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:42,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,159 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,160 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:42,165 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-08 14:55:42,165 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-08 14:55:42,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:42,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:42,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 14:55:42,166 INFO L87 Difference]: Start difference. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 281 states. [2022-04-08 14:55:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:42,171 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-08 14:55:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-08 14:55:42,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:42,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:42,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:42,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 487 transitions. [2022-04-08 14:55:42,177 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 487 transitions. Word has length 24 [2022-04-08 14:55:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:42,178 INFO L478 AbstractCegarLoop]: Abstraction has 279 states and 487 transitions. [2022-04-08 14:55:42,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 279 states and 487 transitions. [2022-04-08 14:55:42,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 487 transitions. [2022-04-08 14:55:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:55:42,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:42,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:42,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 14:55:42,602 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 1 times [2022-04-08 14:55:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:42,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230040081] [2022-04-08 14:55:42,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 2 times [2022-04-08 14:55:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:42,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373372224] [2022-04-08 14:55:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:42,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:42,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-08 14:55:42,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-08 14:55:42,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:42,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret16 := main(); {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {7361#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 != ~p1~0); {7361#true} is VALID [2022-04-08 14:55:42,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume !(0 != ~p2~0); {7361#true} is VALID [2022-04-08 14:55:42,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {7361#true} assume 0 != ~p3~0;~lk3~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-08 14:55:42,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7362#false} is VALID [2022-04-08 14:55:42,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {7362#false} assume 0 != ~p4~0; {7362#false} is VALID [2022-04-08 14:55:42,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {7362#false} assume 1 != ~lk4~0; {7362#false} is VALID [2022-04-08 14:55:42,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-08 14:55:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:42,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373372224] [2022-04-08 14:55:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373372224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:42,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230040081] [2022-04-08 14:55:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230040081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164722949] [2022-04-08 14:55:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:55:42,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:42,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:42,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:42,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:42,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:42,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:42,698 INFO L87 Difference]: Start difference. First operand 279 states and 487 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:42,857 INFO L93 Difference]: Finished difference Result 421 states and 733 transitions. [2022-04-08 14:55:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:55:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 14:55:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-08 14:55:42,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-08 14:55:42,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:42,981 INFO L225 Difference]: With dead ends: 421 [2022-04-08 14:55:42,981 INFO L226 Difference]: Without dead ends: 287 [2022-04-08 14:55:42,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:42,982 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:42,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-08 14:55:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-04-08 14:55:42,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:42,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,997 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:42,997 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:43,002 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-08 14:55:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-08 14:55:43,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:43,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:43,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 14:55:43,004 INFO L87 Difference]: Start difference. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 287 states. [2022-04-08 14:55:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:43,008 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-08 14:55:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-08 14:55:43,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:43,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:43,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:43,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 491 transitions. [2022-04-08 14:55:43,014 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 491 transitions. Word has length 25 [2022-04-08 14:55:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:43,014 INFO L478 AbstractCegarLoop]: Abstraction has 285 states and 491 transitions. [2022-04-08 14:55:43,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 491 transitions. [2022-04-08 14:55:43,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 491 transitions. [2022-04-08 14:55:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:55:43,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:43,449 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:43,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 14:55:43,450 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 1 times [2022-04-08 14:55:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:43,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545525792] [2022-04-08 14:55:43,450 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 2 times [2022-04-08 14:55:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:43,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507021313] [2022-04-08 14:55:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:43,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-08 14:55:43,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-08 14:55:43,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-08 14:55:43,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {9359#true} call ULTIMATE.init(); {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {9359#true} call #t~ret16 := main(); {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {9359#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {9359#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {9359#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {9359#true} assume !(0 != ~p1~0); {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {9359#true} assume !(0 != ~p2~0); {9359#true} is VALID [2022-04-08 14:55:43,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {9359#true} assume !(0 != ~p3~0); {9359#true} is VALID [2022-04-08 14:55:43,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {9359#true} assume 0 != ~p4~0;~lk4~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p4~0; {9364#(= main_~lk4~0 1)} is VALID [2022-04-08 14:55:43,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {9364#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {9360#false} is VALID [2022-04-08 14:55:43,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {9360#false} assume !false; {9360#false} is VALID [2022-04-08 14:55:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:43,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507021313] [2022-04-08 14:55:43,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507021313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:43,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:43,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:43,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:43,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545525792] [2022-04-08 14:55:43,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545525792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:43,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:43,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106184570] [2022-04-08 14:55:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:43,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:55:43,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:43,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:43,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:43,522 INFO L87 Difference]: Start difference. First operand 285 states and 491 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:43,694 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2022-04-08 14:55:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:55:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 14:55:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-08 14:55:43,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-08 14:55:43,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:43,793 INFO L225 Difference]: With dead ends: 525 [2022-04-08 14:55:43,793 INFO L226 Difference]: Without dead ends: 523 [2022-04-08 14:55:43,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:43,795 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:43,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-08 14:55:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 393. [2022-04-08 14:55:43,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:43,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,815 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,816 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:43,826 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-08 14:55:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-08 14:55:43,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:43,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:43,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-08 14:55:43,828 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-08 14:55:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:43,839 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-08 14:55:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-08 14:55:43,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:43,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:43,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:43,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 667 transitions. [2022-04-08 14:55:43,856 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 667 transitions. Word has length 25 [2022-04-08 14:55:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:43,857 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 667 transitions. [2022-04-08 14:55:43,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:43,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 667 transitions. [2022-04-08 14:55:44,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 667 transitions. [2022-04-08 14:55:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 14:55:44,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:44,403 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:44,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 14:55:44,403 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 1 times [2022-04-08 14:55:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1950970593] [2022-04-08 14:55:44,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 2 times [2022-04-08 14:55:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:44,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887687637] [2022-04-08 14:55:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:44,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:44,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-08 14:55:44,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-08 14:55:44,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-08 14:55:44,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {12253#true} call ULTIMATE.init(); {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:44,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-08 14:55:44,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-08 14:55:44,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-08 14:55:44,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#true} call #t~ret16 := main(); {12253#true} is VALID [2022-04-08 14:55:44,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {12253#true} is VALID [2022-04-08 14:55:44,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {12253#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {12253#true} is VALID [2022-04-08 14:55:44,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {12253#true} is VALID [2022-04-08 14:55:44,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#true} assume !(0 != ~p1~0); {12253#true} is VALID [2022-04-08 14:55:44,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#true} assume !(0 != ~p2~0); {12253#true} is VALID [2022-04-08 14:55:44,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {12253#true} assume !(0 != ~p3~0); {12253#true} is VALID [2022-04-08 14:55:44,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#true} assume !(0 != ~p4~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p10~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p1~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p2~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p3~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-08 14:55:44,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p4~0; {12254#false} is VALID [2022-04-08 14:55:44,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {12254#false} assume 1 != ~lk4~0; {12254#false} is VALID [2022-04-08 14:55:44,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {12254#false} assume !false; {12254#false} is VALID [2022-04-08 14:55:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:44,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887687637] [2022-04-08 14:55:44,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887687637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:44,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:44,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:44,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:44,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1950970593] [2022-04-08 14:55:44,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1950970593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:44,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:44,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598038631] [2022-04-08 14:55:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:55:44,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:44,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:44,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:44,461 INFO L87 Difference]: Start difference. First operand 393 states and 667 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:44,688 INFO L93 Difference]: Finished difference Result 925 states and 1581 transitions. [2022-04-08 14:55:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 14:55:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-08 14:55:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-08 14:55:44,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-08 14:55:44,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:44,833 INFO L225 Difference]: With dead ends: 925 [2022-04-08 14:55:44,834 INFO L226 Difference]: Without dead ends: 547 [2022-04-08 14:55:44,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:44,835 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:44,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-08 14:55:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-04-08 14:55:44,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:44,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,864 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,866 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:44,877 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-08 14:55:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-08 14:55:44,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:44,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:44,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 547 states. [2022-04-08 14:55:44,880 INFO L87 Difference]: Start difference. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 547 states. [2022-04-08 14:55:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:44,891 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-08 14:55:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-08 14:55:44,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:44,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:44,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:44,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 919 transitions. [2022-04-08 14:55:44,907 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 919 transitions. Word has length 25 [2022-04-08 14:55:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:44,907 INFO L478 AbstractCegarLoop]: Abstraction has 545 states and 919 transitions. [2022-04-08 14:55:44,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:44,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 545 states and 919 transitions. [2022-04-08 14:55:45,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 919 transitions. [2022-04-08 14:55:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:55:45,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:45,707 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:45,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 14:55:45,707 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 1 times [2022-04-08 14:55:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:45,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1094643255] [2022-04-08 14:55:45,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 2 times [2022-04-08 14:55:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:45,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269844205] [2022-04-08 14:55:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:45,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-08 14:55:45,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-08 14:55:45,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {16299#true} call ULTIMATE.init(); {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:45,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {16299#true} call #t~ret16 := main(); {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {16299#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {16299#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {16299#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {16299#true} assume !(0 != ~p1~0); {16299#true} is VALID [2022-04-08 14:55:45,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {16299#true} assume !(0 != ~p2~0); {16299#true} is VALID [2022-04-08 14:55:45,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {16299#true} assume !(0 != ~p3~0); {16299#true} is VALID [2022-04-08 14:55:45,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {16299#true} assume 0 != ~p4~0;~lk4~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-08 14:55:45,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {16300#false} is VALID [2022-04-08 14:55:45,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#false} assume 0 != ~p5~0; {16300#false} is VALID [2022-04-08 14:55:45,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {16300#false} assume 1 != ~lk5~0; {16300#false} is VALID [2022-04-08 14:55:45,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {16300#false} assume !false; {16300#false} is VALID [2022-04-08 14:55:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:45,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269844205] [2022-04-08 14:55:45,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269844205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:45,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:45,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:45,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1094643255] [2022-04-08 14:55:45,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1094643255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:45,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:45,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349645086] [2022-04-08 14:55:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:45,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:55:45,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:45,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:45,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:45,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:45,771 INFO L87 Difference]: Start difference. First operand 545 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:45,955 INFO L93 Difference]: Finished difference Result 817 states and 1373 transitions. [2022-04-08 14:55:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:55:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 14:55:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 14:55:45,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-08 14:55:46,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:46,084 INFO L225 Difference]: With dead ends: 817 [2022-04-08 14:55:46,085 INFO L226 Difference]: Without dead ends: 555 [2022-04-08 14:55:46,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:46,086 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:46,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 114 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-08 14:55:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2022-04-08 14:55:46,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:46,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:46,116 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:46,116 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:46,128 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-08 14:55:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-08 14:55:46,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:46,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:46,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 555 states. [2022-04-08 14:55:46,131 INFO L87 Difference]: Start difference. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 555 states. [2022-04-08 14:55:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:46,142 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-08 14:55:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-08 14:55:46,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:46,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:46,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:46,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2022-04-08 14:55:46,158 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 26 [2022-04-08 14:55:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:46,159 INFO L478 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2022-04-08 14:55:46,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:46,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 919 transitions. [2022-04-08 14:55:46,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2022-04-08 14:55:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:55:46,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:46,942 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:46,942 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 14:55:46,942 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 1 times [2022-04-08 14:55:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:46,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257225856] [2022-04-08 14:55:46,943 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:46,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 2 times [2022-04-08 14:55:46,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:46,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452609947] [2022-04-08 14:55:46,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:46,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:46,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:46,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-08 14:55:46,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-08 14:55:46,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-08 14:55:46,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {20161#true} call ULTIMATE.init(); {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:46,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {20161#true} call #t~ret16 := main(); {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {20161#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {20161#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {20161#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {20161#true} assume !(0 != ~p1~0); {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {20161#true} assume !(0 != ~p2~0); {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {20161#true} assume !(0 != ~p3~0); {20161#true} is VALID [2022-04-08 14:55:46,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {20161#true} assume !(0 != ~p4~0); {20161#true} is VALID [2022-04-08 14:55:46,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#true} assume 0 != ~p5~0;~lk5~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p5~0; {20166#(= main_~lk5~0 1)} is VALID [2022-04-08 14:55:46,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {20166#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {20162#false} is VALID [2022-04-08 14:55:46,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {20162#false} assume !false; {20162#false} is VALID [2022-04-08 14:55:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452609947] [2022-04-08 14:55:46,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452609947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:46,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:46,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:46,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257225856] [2022-04-08 14:55:46,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257225856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:46,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:46,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971496889] [2022-04-08 14:55:46,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:46,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:55:46,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:46,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:47,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:47,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:47,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:47,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:47,006 INFO L87 Difference]: Start difference. First operand 553 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:47,273 INFO L93 Difference]: Finished difference Result 1005 states and 1697 transitions. [2022-04-08 14:55:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:47,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:55:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 14:55:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 14:55:47,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 14:55:47,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:47,413 INFO L225 Difference]: With dead ends: 1005 [2022-04-08 14:55:47,414 INFO L226 Difference]: Without dead ends: 1003 [2022-04-08 14:55:47,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:47,414 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:47,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-08 14:55:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 777. [2022-04-08 14:55:47,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:47,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,457 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,458 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:47,490 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-08 14:55:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-08 14:55:47,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:47,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:47,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1003 states. [2022-04-08 14:55:47,494 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1003 states. [2022-04-08 14:55:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:47,526 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-08 14:55:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-08 14:55:47,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:47,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:47,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:47,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1263 transitions. [2022-04-08 14:55:47,565 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1263 transitions. Word has length 26 [2022-04-08 14:55:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:47,566 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1263 transitions. [2022-04-08 14:55:47,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:47,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1263 transitions. [2022-04-08 14:55:48,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1263 transitions. [2022-04-08 14:55:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:55:48,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:48,718 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:48,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 14:55:48,718 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 1 times [2022-04-08 14:55:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:48,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494752332] [2022-04-08 14:55:48,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 2 times [2022-04-08 14:55:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:48,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016800605] [2022-04-08 14:55:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:48,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-08 14:55:48,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-08 14:55:48,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-08 14:55:48,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {25743#true} call ULTIMATE.init(); {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:48,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-08 14:55:48,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-08 14:55:48,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-08 14:55:48,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {25743#true} call #t~ret16 := main(); {25743#true} is VALID [2022-04-08 14:55:48,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {25743#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {25743#true} is VALID [2022-04-08 14:55:48,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {25743#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {25743#true} is VALID [2022-04-08 14:55:48,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {25743#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {25743#true} is VALID [2022-04-08 14:55:48,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {25743#true} assume !(0 != ~p1~0); {25743#true} is VALID [2022-04-08 14:55:48,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {25743#true} assume !(0 != ~p2~0); {25743#true} is VALID [2022-04-08 14:55:48,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {25743#true} assume !(0 != ~p3~0); {25743#true} is VALID [2022-04-08 14:55:48,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {25743#true} assume !(0 != ~p4~0); {25743#true} is VALID [2022-04-08 14:55:48,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {25743#true} assume !(0 != ~p5~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p10~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p1~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p2~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p3~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p4~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-08 14:55:48,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p5~0; {25744#false} is VALID [2022-04-08 14:55:48,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {25744#false} assume 1 != ~lk5~0; {25744#false} is VALID [2022-04-08 14:55:48,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {25744#false} assume !false; {25744#false} is VALID [2022-04-08 14:55:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016800605] [2022-04-08 14:55:48,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016800605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:48,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:48,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:48,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494752332] [2022-04-08 14:55:48,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494752332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:48,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:48,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:48,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895033762] [2022-04-08 14:55:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:48,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:55:48,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:48,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:48,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:48,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:48,787 INFO L87 Difference]: Start difference. First operand 777 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:49,151 INFO L93 Difference]: Finished difference Result 1821 states and 2977 transitions. [2022-04-08 14:55:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 14:55:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-08 14:55:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-08 14:55:49,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 198 transitions. [2022-04-08 14:55:49,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:49,336 INFO L225 Difference]: With dead ends: 1821 [2022-04-08 14:55:49,336 INFO L226 Difference]: Without dead ends: 1067 [2022-04-08 14:55:49,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:49,338 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:49,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 111 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-04-08 14:55:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2022-04-08 14:55:49,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:49,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,400 INFO L74 IsIncluded]: Start isIncluded. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,401 INFO L87 Difference]: Start difference. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:49,435 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-08 14:55:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-08 14:55:49,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:49,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:49,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1067 states. [2022-04-08 14:55:49,439 INFO L87 Difference]: Start difference. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1067 states. [2022-04-08 14:55:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:49,475 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-08 14:55:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-08 14:55:49,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:49,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:49,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:49,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1719 transitions. [2022-04-08 14:55:49,526 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1719 transitions. Word has length 26 [2022-04-08 14:55:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:49,526 INFO L478 AbstractCegarLoop]: Abstraction has 1065 states and 1719 transitions. [2022-04-08 14:55:49,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:49,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1065 states and 1719 transitions. [2022-04-08 14:55:51,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1719 transitions. [2022-04-08 14:55:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:55:51,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:51,076 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:51,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 14:55:51,076 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 1 times [2022-04-08 14:55:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:51,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893412382] [2022-04-08 14:55:51,077 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 2 times [2022-04-08 14:55:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:51,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986854488] [2022-04-08 14:55:51,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:51,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:51,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-08 14:55:51,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-08 14:55:51,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-08 14:55:51,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {33661#true} call ULTIMATE.init(); {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:51,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-08 14:55:51,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-08 14:55:51,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {33661#true} call #t~ret16 := main(); {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {33661#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {33661#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {33661#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {33661#true} assume !(0 != ~p1~0); {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {33661#true} assume !(0 != ~p2~0); {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {33661#true} assume !(0 != ~p3~0); {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {33661#true} assume !(0 != ~p4~0); {33661#true} is VALID [2022-04-08 14:55:51,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {33661#true} assume 0 != ~p5~0;~lk5~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-08 14:55:51,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {33662#false} is VALID [2022-04-08 14:55:51,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {33662#false} assume 0 != ~p6~0; {33662#false} is VALID [2022-04-08 14:55:51,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {33662#false} assume 1 != ~lk6~0; {33662#false} is VALID [2022-04-08 14:55:51,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {33662#false} assume !false; {33662#false} is VALID [2022-04-08 14:55:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:51,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986854488] [2022-04-08 14:55:51,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986854488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:51,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:51,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:51,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:51,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893412382] [2022-04-08 14:55:51,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893412382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:51,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:51,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610526642] [2022-04-08 14:55:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:51,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:55:51,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:51,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:51,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:51,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:51,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:51,136 INFO L87 Difference]: Start difference. First operand 1065 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:51,425 INFO L93 Difference]: Finished difference Result 1597 states and 2569 transitions. [2022-04-08 14:55:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:55:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-08 14:55:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-08 14:55:51,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-04-08 14:55:51,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:51,588 INFO L225 Difference]: With dead ends: 1597 [2022-04-08 14:55:51,589 INFO L226 Difference]: Without dead ends: 1083 [2022-04-08 14:55:51,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:51,590 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:51,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-04-08 14:55:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-04-08 14:55:51,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:51,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,663 INFO L74 IsIncluded]: Start isIncluded. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,664 INFO L87 Difference]: Start difference. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:51,699 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-08 14:55:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-08 14:55:51,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:51,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:51,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1083 states. [2022-04-08 14:55:51,703 INFO L87 Difference]: Start difference. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1083 states. [2022-04-08 14:55:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:51,738 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-08 14:55:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-08 14:55:51,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:51,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:51,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:51,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-04-08 14:55:51,793 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-04-08 14:55:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:51,793 INFO L478 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-04-08 14:55:51,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:51,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1081 states and 1719 transitions. [2022-04-08 14:55:53,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-04-08 14:55:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:55:53,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:53,339 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:53,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 14:55:53,339 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:53,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 1 times [2022-04-08 14:55:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:53,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641191597] [2022-04-08 14:55:53,341 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 2 times [2022-04-08 14:55:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:53,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180610902] [2022-04-08 14:55:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:53,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:53,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-08 14:55:53,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 14:55:53,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret16 := main(); {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {41195#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 != ~p1~0); {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume !(0 != ~p2~0); {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {41195#true} assume !(0 != ~p3~0); {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {41195#true} assume !(0 != ~p4~0); {41195#true} is VALID [2022-04-08 14:55:53,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} assume !(0 != ~p5~0); {41195#true} is VALID [2022-04-08 14:55:53,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume 0 != ~p6~0;~lk6~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p6~0; {41200#(= main_~lk6~0 1)} is VALID [2022-04-08 14:55:53,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {41200#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {41196#false} is VALID [2022-04-08 14:55:53,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-08 14:55:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:53,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:53,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180610902] [2022-04-08 14:55:53,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180610902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:53,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:53,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:53,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:53,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641191597] [2022-04-08 14:55:53,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641191597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:53,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:53,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746877457] [2022-04-08 14:55:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:55:53,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:53,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:53,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:53,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:53,406 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:53,900 INFO L93 Difference]: Finished difference Result 1933 states and 3129 transitions. [2022-04-08 14:55:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:53,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:55:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:55:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 14:55:53,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 14:55:53,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:54,144 INFO L225 Difference]: With dead ends: 1933 [2022-04-08 14:55:54,144 INFO L226 Difference]: Without dead ends: 1931 [2022-04-08 14:55:54,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:54,145 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:54,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-08 14:55:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-04-08 14:55:54,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:54,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:54,250 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:54,251 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:54,362 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-08 14:55:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-08 14:55:54,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:54,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:54,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-08 14:55:54,367 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-08 14:55:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:54,473 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-08 14:55:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-08 14:55:54,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:54,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:54,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:54,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-04-08 14:55:54,584 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-04-08 14:55:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:54,584 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-04-08 14:55:54,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:54,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2391 transitions. [2022-04-08 14:55:56,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2391 edges. 2391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-04-08 14:55:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 14:55:56,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:55:56,779 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:55:56,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 14:55:56,779 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:55:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:55:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 1 times [2022-04-08 14:55:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:56,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [740793434] [2022-04-08 14:55:56,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:55:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 2 times [2022-04-08 14:55:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:55:56,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624604354] [2022-04-08 14:55:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:55:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:55:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:55:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:55:56,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-08 14:55:56,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-08 14:55:56,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {52025#true} call ULTIMATE.init(); {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {52025#true} call #t~ret16 := main(); {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {52025#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {52025#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {52025#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {52025#true} assume !(0 != ~p1~0); {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {52025#true} assume !(0 != ~p2~0); {52025#true} is VALID [2022-04-08 14:55:56,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {52025#true} assume !(0 != ~p3~0); {52025#true} is VALID [2022-04-08 14:55:56,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {52025#true} assume !(0 != ~p4~0); {52025#true} is VALID [2022-04-08 14:55:56,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {52025#true} assume !(0 != ~p5~0); {52025#true} is VALID [2022-04-08 14:55:56,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {52025#true} assume !(0 != ~p6~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p10~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p1~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p2~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p3~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p4~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p5~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-08 14:55:56,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p6~0; {52026#false} is VALID [2022-04-08 14:55:56,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {52026#false} assume 1 != ~lk6~0; {52026#false} is VALID [2022-04-08 14:55:56,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {52026#false} assume !false; {52026#false} is VALID [2022-04-08 14:55:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:55:56,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:55:56,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624604354] [2022-04-08 14:55:56,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624604354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:56,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:56,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:56,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:55:56,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [740793434] [2022-04-08 14:55:56,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [740793434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:55:56,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:55:56,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:55:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827226756] [2022-04-08 14:55:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:55:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:55:56,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:55:56,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:56,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:56,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:55:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:55:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:55:56,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:55:56,857 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:57,813 INFO L93 Difference]: Finished difference Result 3597 states and 5593 transitions. [2022-04-08 14:55:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:55:57,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 14:55:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:55:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 14:55:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 14:55:57,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-08 14:55:57,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:55:58,111 INFO L225 Difference]: With dead ends: 3597 [2022-04-08 14:55:58,111 INFO L226 Difference]: Without dead ends: 2091 [2022-04-08 14:55:58,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:55:58,113 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:55:58,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:55:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-08 14:55:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-04-08 14:55:58,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:55:58,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:58,268 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:58,271 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:58,390 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-08 14:55:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-08 14:55:58,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:58,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:58,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2091 states. [2022-04-08 14:55:58,396 INFO L87 Difference]: Start difference. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2091 states. [2022-04-08 14:55:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:55:58,521 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-08 14:55:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-08 14:55:58,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:55:58,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:55:58,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:55:58,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:55:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-04-08 14:55:58,735 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-04-08 14:55:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:55:58,735 INFO L478 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-04-08 14:55:58,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:55:58,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2089 states and 3207 transitions. [2022-04-08 14:56:01,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-04-08 14:56:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:56:01,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:01,804 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:01,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 14:56:01,804 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 1 times [2022-04-08 14:56:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:01,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679438765] [2022-04-08 14:56:01,805 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 2 times [2022-04-08 14:56:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:01,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823507641] [2022-04-08 14:56:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:01,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-08 14:56:01,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-08 14:56:01,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {67591#true} call ULTIMATE.init(); {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {67591#true} call #t~ret16 := main(); {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {67591#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {67591#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {67591#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {67591#true} assume !(0 != ~p1~0); {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {67591#true} assume !(0 != ~p2~0); {67591#true} is VALID [2022-04-08 14:56:01,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {67591#true} assume !(0 != ~p3~0); {67591#true} is VALID [2022-04-08 14:56:01,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {67591#true} assume !(0 != ~p4~0); {67591#true} is VALID [2022-04-08 14:56:01,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {67591#true} assume !(0 != ~p5~0); {67591#true} is VALID [2022-04-08 14:56:01,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {67591#true} assume 0 != ~p6~0;~lk6~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-08 14:56:01,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {67592#false} is VALID [2022-04-08 14:56:01,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {67592#false} assume 0 != ~p7~0; {67592#false} is VALID [2022-04-08 14:56:01,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {67592#false} assume 1 != ~lk7~0; {67592#false} is VALID [2022-04-08 14:56:01,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {67592#false} assume !false; {67592#false} is VALID [2022-04-08 14:56:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:01,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823507641] [2022-04-08 14:56:01,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823507641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:01,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:01,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:01,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:01,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679438765] [2022-04-08 14:56:01,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679438765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:01,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:01,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602153565] [2022-04-08 14:56:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:56:01,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:01,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:01,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:01,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:01,853 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:02,610 INFO L93 Difference]: Finished difference Result 3133 states and 4793 transitions. [2022-04-08 14:56:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:56:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:56:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:56:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 14:56:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-08 14:56:02,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-08 14:56:02,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:02,918 INFO L225 Difference]: With dead ends: 3133 [2022-04-08 14:56:02,918 INFO L226 Difference]: Without dead ends: 2123 [2022-04-08 14:56:02,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:56:02,920 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:56:02,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:56:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-08 14:56:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-04-08 14:56:03,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:56:03,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:03,060 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:03,062 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:03,180 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-08 14:56:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-08 14:56:03,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:03,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:03,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-08 14:56:03,187 INFO L87 Difference]: Start difference. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2123 states. [2022-04-08 14:56:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:03,307 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-08 14:56:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-08 14:56:03,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:03,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:03,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:56:03,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:56:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-04-08 14:56:03,532 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-04-08 14:56:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:56:03,533 INFO L478 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-04-08 14:56:03,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:03,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2121 states and 3207 transitions. [2022-04-08 14:56:06,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-04-08 14:56:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:56:06,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:06,739 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:06,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 14:56:06,739 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 1 times [2022-04-08 14:56:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:06,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957668406] [2022-04-08 14:56:06,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 2 times [2022-04-08 14:56:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:06,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491507852] [2022-04-08 14:56:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:06,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-08 14:56:06,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {82357#true} call ULTIMATE.init(); {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:56:06,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {82357#true} call #t~ret16 := main(); {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {82357#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {82357#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {82357#true} is VALID [2022-04-08 14:56:06,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {82357#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {82357#true} is VALID [2022-04-08 14:56:06,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {82357#true} assume !(0 != ~p1~0); {82357#true} is VALID [2022-04-08 14:56:06,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {82357#true} assume !(0 != ~p2~0); {82357#true} is VALID [2022-04-08 14:56:06,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {82357#true} assume !(0 != ~p3~0); {82357#true} is VALID [2022-04-08 14:56:06,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {82357#true} assume !(0 != ~p4~0); {82357#true} is VALID [2022-04-08 14:56:06,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {82357#true} assume !(0 != ~p5~0); {82357#true} is VALID [2022-04-08 14:56:06,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {82357#true} assume !(0 != ~p6~0); {82357#true} is VALID [2022-04-08 14:56:06,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {82357#true} assume 0 != ~p7~0;~lk7~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p7~0; {82362#(= main_~lk7~0 1)} is VALID [2022-04-08 14:56:06,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {82362#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {82358#false} is VALID [2022-04-08 14:56:06,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {82358#false} assume !false; {82358#false} is VALID [2022-04-08 14:56:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:06,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:06,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491507852] [2022-04-08 14:56:06,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491507852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:06,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:06,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:06,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:06,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957668406] [2022-04-08 14:56:06,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957668406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:06,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:06,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543492166] [2022-04-08 14:56:06,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:56:06,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:06,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:06,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:06,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:06,796 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:07,847 INFO L93 Difference]: Finished difference Result 3725 states and 5737 transitions. [2022-04-08 14:56:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:56:07,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:56:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:56:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 14:56:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-08 14:56:07,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-08 14:56:07,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:08,538 INFO L225 Difference]: With dead ends: 3725 [2022-04-08 14:56:08,538 INFO L226 Difference]: Without dead ends: 3723 [2022-04-08 14:56:08,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:56:08,539 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:56:08,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:56:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-08 14:56:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-04-08 14:56:08,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:56:08,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:08,809 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:08,811 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:09,277 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-08 14:56:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-08 14:56:09,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:09,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:09,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-08 14:56:09,286 INFO L87 Difference]: Start difference. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-08 14:56:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:09,698 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-08 14:56:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-08 14:56:09,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:09,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:09,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:56:09,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:56:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-04-08 14:56:10,236 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-04-08 14:56:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:56:10,236 INFO L478 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-04-08 14:56:10,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:10,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3081 states and 4519 transitions. [2022-04-08 14:56:14,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4519 edges. 4519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-04-08 14:56:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:56:14,630 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:14,630 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:14,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 14:56:14,630 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 1 times [2022-04-08 14:56:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:14,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988867920] [2022-04-08 14:56:14,631 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 2 times [2022-04-08 14:56:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:14,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225244348] [2022-04-08 14:56:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:14,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-08 14:56:14,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-08 14:56:14,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-08 14:56:14,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {103427#true} call ULTIMATE.init(); {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:56:14,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-08 14:56:14,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-08 14:56:14,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-08 14:56:14,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {103427#true} call #t~ret16 := main(); {103427#true} is VALID [2022-04-08 14:56:14,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {103427#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {103427#true} is VALID [2022-04-08 14:56:14,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {103427#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {103427#true} is VALID [2022-04-08 14:56:14,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {103427#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {103427#true} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {103427#true} assume !(0 != ~p1~0); {103427#true} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {103427#true} assume !(0 != ~p2~0); {103427#true} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {103427#true} assume !(0 != ~p3~0); {103427#true} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {103427#true} assume !(0 != ~p4~0); {103427#true} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {103427#true} assume !(0 != ~p5~0); {103427#true} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {103427#true} assume !(0 != ~p6~0); {103427#true} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {103427#true} assume !(0 != ~p7~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p10~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p1~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p2~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p3~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p4~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p5~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p6~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-08 14:56:14,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p7~0; {103428#false} is VALID [2022-04-08 14:56:14,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {103428#false} assume 1 != ~lk7~0; {103428#false} is VALID [2022-04-08 14:56:14,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {103428#false} assume !false; {103428#false} is VALID [2022-04-08 14:56:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:14,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:14,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225244348] [2022-04-08 14:56:14,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225244348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:14,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:14,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:14,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:14,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988867920] [2022-04-08 14:56:14,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988867920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:14,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:14,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153015877] [2022-04-08 14:56:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:56:14,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:14,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:14,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:14,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:14,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:14,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:14,698 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:17,530 INFO L93 Difference]: Finished difference Result 7117 states and 10473 transitions. [2022-04-08 14:56:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:56:17,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-08 14:56:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:56:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 14:56:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-08 14:56:17,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-08 14:56:17,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:18,348 INFO L225 Difference]: With dead ends: 7117 [2022-04-08 14:56:18,349 INFO L226 Difference]: Without dead ends: 4107 [2022-04-08 14:56:18,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:56:18,353 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:56:18,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:56:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-08 14:56:18,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-04-08 14:56:18,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:56:18,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:18,669 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:18,673 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:19,155 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-08 14:56:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-08 14:56:19,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:19,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:19,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-08 14:56:19,166 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4107 states. [2022-04-08 14:56:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:19,656 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-08 14:56:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-08 14:56:19,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:19,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:19,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:56:19,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:56:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-04-08 14:56:20,463 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-04-08 14:56:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:56:20,463 INFO L478 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-04-08 14:56:20,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:20,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 5959 transitions. [2022-04-08 14:56:26,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-04-08 14:56:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:56:26,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:26,526 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:26,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 14:56:26,527 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 1 times [2022-04-08 14:56:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:26,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1003708348] [2022-04-08 14:56:26,527 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 2 times [2022-04-08 14:56:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:26,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438161698] [2022-04-08 14:56:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:26,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-08 14:56:26,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-08 14:56:26,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {134097#true} call ULTIMATE.init(); {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {134097#true} call #t~ret16 := main(); {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {134097#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {134097#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {134097#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {134097#true} assume !(0 != ~p1~0); {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {134097#true} assume !(0 != ~p2~0); {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {134097#true} assume !(0 != ~p3~0); {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {134097#true} assume !(0 != ~p4~0); {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {134097#true} assume !(0 != ~p5~0); {134097#true} is VALID [2022-04-08 14:56:26,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {134097#true} assume !(0 != ~p6~0); {134097#true} is VALID [2022-04-08 14:56:26,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {134097#true} assume 0 != ~p7~0;~lk7~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-08 14:56:26,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {134098#false} is VALID [2022-04-08 14:56:26,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {134098#false} assume 0 != ~p8~0; {134098#false} is VALID [2022-04-08 14:56:26,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {134098#false} assume 1 != ~lk8~0; {134098#false} is VALID [2022-04-08 14:56:26,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {134098#false} assume !false; {134098#false} is VALID [2022-04-08 14:56:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:26,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438161698] [2022-04-08 14:56:26,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438161698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:26,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:26,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:26,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:26,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1003708348] [2022-04-08 14:56:26,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1003708348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:26,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:26,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440278204] [2022-04-08 14:56:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 14:56:26,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:26,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:26,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:26,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:26,576 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:28,875 INFO L93 Difference]: Finished difference Result 6157 states and 8905 transitions. [2022-04-08 14:56:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:56:28,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 14:56:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:56:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 14:56:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-08 14:56:28,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-08 14:56:28,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:29,722 INFO L225 Difference]: With dead ends: 6157 [2022-04-08 14:56:29,722 INFO L226 Difference]: Without dead ends: 4171 [2022-04-08 14:56:29,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:56:29,725 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:56:29,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:56:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-04-08 14:56:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-04-08 14:56:30,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:56:30,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:30,037 INFO L74 IsIncluded]: Start isIncluded. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:30,039 INFO L87 Difference]: Start difference. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:30,517 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-08 14:56:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-08 14:56:30,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:30,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:30,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4171 states. [2022-04-08 14:56:30,530 INFO L87 Difference]: Start difference. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4171 states. [2022-04-08 14:56:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:31,011 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-08 14:56:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-08 14:56:31,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:31,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:31,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:56:31,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:56:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-04-08 14:56:31,839 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-04-08 14:56:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:56:31,839 INFO L478 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-04-08 14:56:31,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:31,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4169 states and 5959 transitions. [2022-04-08 14:56:37,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-04-08 14:56:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:56:37,802 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:37,803 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:37,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 14:56:37,803 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:37,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 1 times [2022-04-08 14:56:37,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:37,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1725529255] [2022-04-08 14:56:37,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:37,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 2 times [2022-04-08 14:56:37,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:37,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466853884] [2022-04-08 14:56:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:37,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-08 14:56:37,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {163103#true} call ULTIMATE.init(); {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:56:37,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {163103#true} call #t~ret16 := main(); {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {163103#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {163103#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {163103#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {163103#true} assume !(0 != ~p1~0); {163103#true} is VALID [2022-04-08 14:56:37,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {163103#true} assume !(0 != ~p2~0); {163103#true} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {163103#true} assume !(0 != ~p3~0); {163103#true} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {163103#true} assume !(0 != ~p4~0); {163103#true} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {163103#true} assume !(0 != ~p5~0); {163103#true} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {163103#true} assume !(0 != ~p6~0); {163103#true} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {163103#true} assume !(0 != ~p7~0); {163103#true} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {163103#true} assume 0 != ~p8~0;~lk8~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p8~0; {163108#(= main_~lk8~0 1)} is VALID [2022-04-08 14:56:37,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {163108#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {163104#false} is VALID [2022-04-08 14:56:37,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {163104#false} assume !false; {163104#false} is VALID [2022-04-08 14:56:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466853884] [2022-04-08 14:56:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466853884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:37,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:37,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:37,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1725529255] [2022-04-08 14:56:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1725529255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:37,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:37,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353890793] [2022-04-08 14:56:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 14:56:37,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:37,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:37,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:37,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:37,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:37,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:37,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:37,856 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:41,004 INFO L93 Difference]: Finished difference Result 7181 states and 10441 transitions. [2022-04-08 14:56:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:56:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 14:56:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:56:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:56:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:56:41,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 14:56:41,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:43,349 INFO L225 Difference]: With dead ends: 7181 [2022-04-08 14:56:43,349 INFO L226 Difference]: Without dead ends: 7179 [2022-04-08 14:56:43,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:56:43,351 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:56:43,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:56:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-04-08 14:56:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-04-08 14:56:43,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:56:43,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:43,835 INFO L74 IsIncluded]: Start isIncluded. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:43,839 INFO L87 Difference]: Start difference. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:45,392 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-08 14:56:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-08 14:56:45,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:45,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:45,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7179 states. [2022-04-08 14:56:45,407 INFO L87 Difference]: Start difference. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 7179 states. [2022-04-08 14:56:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:56:47,003 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-08 14:56:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-08 14:56:47,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:56:47,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:56:47,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:56:47,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:56:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-04-08 14:56:48,885 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-04-08 14:56:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:56:48,885 INFO L478 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-04-08 14:56:48,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:48,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6153 states and 8519 transitions. [2022-04-08 14:56:57,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8519 edges. 8519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-04-08 14:56:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:56:57,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:56:57,640 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:56:57,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 14:56:57,640 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:56:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:56:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 1 times [2022-04-08 14:56:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [69936298] [2022-04-08 14:56:57,641 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:56:57,641 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 2 times [2022-04-08 14:56:57,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:56:57,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813434017] [2022-04-08 14:56:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:56:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:56:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:56:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:56:57,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {204141#true} call ULTIMATE.init(); {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:56:57,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {204141#true} call #t~ret16 := main(); {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {204141#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {204141#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {204141#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {204141#true} is VALID [2022-04-08 14:56:57,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {204141#true} assume !(0 != ~p1~0); {204141#true} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {204141#true} assume !(0 != ~p2~0); {204141#true} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {204141#true} assume !(0 != ~p3~0); {204141#true} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {204141#true} assume !(0 != ~p4~0); {204141#true} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {204141#true} assume !(0 != ~p5~0); {204141#true} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {204141#true} assume !(0 != ~p6~0); {204141#true} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {204141#true} assume !(0 != ~p7~0); {204141#true} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {204141#true} assume !(0 != ~p8~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p10~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p1~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p2~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p3~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p4~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p5~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p6~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p7~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-08 14:56:57,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p8~0; {204142#false} is VALID [2022-04-08 14:56:57,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {204142#false} assume 1 != ~lk8~0; {204142#false} is VALID [2022-04-08 14:56:57,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {204142#false} assume !false; {204142#false} is VALID [2022-04-08 14:56:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:56:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:56:57,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813434017] [2022-04-08 14:56:57,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813434017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:57,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:57,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:57,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:56:57,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [69936298] [2022-04-08 14:56:57,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [69936298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:56:57,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:56:57,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:56:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871222708] [2022-04-08 14:56:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:56:57,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 14:56:57,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:56:57,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:56:57,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:56:57,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:56:57,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:56:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:56:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:56:57,689 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:07,804 INFO L93 Difference]: Finished difference Result 14093 states and 19529 transitions. [2022-04-08 14:57:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:07,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 14:57:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-08 14:57:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-08 14:57:07,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-08 14:57:07,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:10,895 INFO L225 Difference]: With dead ends: 14093 [2022-04-08 14:57:10,895 INFO L226 Difference]: Without dead ends: 8075 [2022-04-08 14:57:10,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:10,903 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:10,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-04-08 14:57:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-04-08 14:57:11,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:11,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:11,513 INFO L74 IsIncluded]: Start isIncluded. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:11,521 INFO L87 Difference]: Start difference. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:13,359 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-08 14:57:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-08 14:57:13,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:13,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:13,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8075 states. [2022-04-08 14:57:13,380 INFO L87 Difference]: Start difference. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8075 states. [2022-04-08 14:57:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:15,274 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-08 14:57:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-08 14:57:15,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:15,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:15,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:15,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-04-08 14:57:18,312 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-04-08 14:57:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:18,312 INFO L478 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-04-08 14:57:18,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:18,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8073 states and 11015 transitions. [2022-04-08 14:57:29,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-04-08 14:57:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:57:29,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:57:29,830 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:57:29,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 14:57:29,831 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:57:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:57:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 1 times [2022-04-08 14:57:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:29,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140324996] [2022-04-08 14:57:29,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:57:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 2 times [2022-04-08 14:57:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:57:29,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732365652] [2022-04-08 14:57:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:57:29,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:57:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:57:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:57:29,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-08 14:57:29,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-08 14:57:29,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-08 14:57:29,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {264635#true} call ULTIMATE.init(); {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {264635#true} call #t~ret16 := main(); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {264635#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {264635#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {264635#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {264635#true} assume !(0 != ~p1~0); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {264635#true} assume !(0 != ~p2~0); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {264635#true} assume !(0 != ~p3~0); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {264635#true} assume !(0 != ~p4~0); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {264635#true} assume !(0 != ~p5~0); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {264635#true} assume !(0 != ~p6~0); {264635#true} is VALID [2022-04-08 14:57:29,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {264635#true} assume !(0 != ~p7~0); {264635#true} is VALID [2022-04-08 14:57:29,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {264635#true} assume 0 != ~p8~0;~lk8~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-08 14:57:29,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {264636#false} is VALID [2022-04-08 14:57:29,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {264636#false} assume 0 != ~p9~0; {264636#false} is VALID [2022-04-08 14:57:29,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {264636#false} assume 1 != ~lk9~0; {264636#false} is VALID [2022-04-08 14:57:29,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {264636#false} assume !false; {264636#false} is VALID [2022-04-08 14:57:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:57:29,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:57:29,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732365652] [2022-04-08 14:57:29,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732365652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:29,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:29,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:29,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:57:29,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140324996] [2022-04-08 14:57:29,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140324996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:57:29,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:57:29,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:57:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072355459] [2022-04-08 14:57:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:57:29,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 14:57:29,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:57:29,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:29,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:29,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:57:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:57:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:57:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:57:29,884 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:36,715 INFO L93 Difference]: Finished difference Result 12109 states and 16457 transitions. [2022-04-08 14:57:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:57:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 14:57:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:57:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 14:57:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 14:57:36,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-08 14:57:36,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:57:40,870 INFO L225 Difference]: With dead ends: 12109 [2022-04-08 14:57:40,871 INFO L226 Difference]: Without dead ends: 8203 [2022-04-08 14:57:40,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:57:40,878 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:57:40,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 102 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:57:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-04-08 14:57:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-04-08 14:57:41,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:57:41,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:41,714 INFO L74 IsIncluded]: Start isIncluded. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:41,726 INFO L87 Difference]: Start difference. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:43,813 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-08 14:57:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-08 14:57:43,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:43,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:43,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8203 states. [2022-04-08 14:57:43,833 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 8203 states. [2022-04-08 14:57:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:57:45,707 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-08 14:57:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-08 14:57:45,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:57:45,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:57:45,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:57:45,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:57:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-04-08 14:57:48,862 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-04-08 14:57:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:57:48,862 INFO L478 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-04-08 14:57:48,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:57:48,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 11015 transitions. [2022-04-08 14:58:00,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-04-08 14:58:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:58:00,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:00,497 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:00,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 14:58:00,498 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 1 times [2022-04-08 14:58:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:00,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758028359] [2022-04-08 14:58:00,498 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 2 times [2022-04-08 14:58:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:00,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456111610] [2022-04-08 14:58:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:00,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-08 14:58:00,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-08 14:58:00,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {321673#true} call ULTIMATE.init(); {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {321673#true} call #t~ret16 := main(); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {321673#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {321673#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {321673#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {321673#true} assume !(0 != ~p1~0); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {321673#true} assume !(0 != ~p2~0); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {321673#true} assume !(0 != ~p3~0); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {321673#true} assume !(0 != ~p4~0); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {321673#true} assume !(0 != ~p5~0); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {321673#true} assume !(0 != ~p6~0); {321673#true} is VALID [2022-04-08 14:58:00,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {321673#true} assume !(0 != ~p7~0); {321673#true} is VALID [2022-04-08 14:58:00,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {321673#true} assume !(0 != ~p8~0); {321673#true} is VALID [2022-04-08 14:58:00,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {321673#true} assume 0 != ~p9~0;~lk9~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p9~0; {321678#(= main_~lk9~0 1)} is VALID [2022-04-08 14:58:00,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {321678#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {321674#false} is VALID [2022-04-08 14:58:00,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {321674#false} assume !false; {321674#false} is VALID [2022-04-08 14:58:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:00,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:00,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456111610] [2022-04-08 14:58:00,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456111610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:00,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:00,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:00,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:00,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758028359] [2022-04-08 14:58:00,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758028359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:00,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:00,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:00,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575708336] [2022-04-08 14:58:00,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 14:58:00,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:00,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:00,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:00,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:00,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:00,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:00,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:00,550 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:11,321 INFO L93 Difference]: Finished difference Result 13837 states and 18825 transitions. [2022-04-08 14:58:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:58:11,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 14:58:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:58:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 14:58:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-08 14:58:11,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-08 14:58:11,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:20,343 INFO L225 Difference]: With dead ends: 13837 [2022-04-08 14:58:20,343 INFO L226 Difference]: Without dead ends: 13835 [2022-04-08 14:58:20,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:58:20,346 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:58:20,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:58:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-04-08 14:58:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-04-08 14:58:21,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:58:21,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:21,344 INFO L74 IsIncluded]: Start isIncluded. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:21,361 INFO L87 Difference]: Start difference. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:27,223 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-08 14:58:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-08 14:58:27,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:27,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:27,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13835 states. [2022-04-08 14:58:27,260 INFO L87 Difference]: Start difference. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13835 states. [2022-04-08 14:58:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:58:32,690 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-08 14:58:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-08 14:58:32,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:58:32,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:58:32,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:58:32,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:58:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-04-08 14:58:40,467 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-04-08 14:58:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:58:40,467 INFO L478 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-04-08 14:58:40,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:40,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12297 states and 16007 transitions. [2022-04-08 14:58:57,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16007 edges. 16007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-04-08 14:58:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 14:58:57,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:58:57,451 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:58:57,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 14:58:57,451 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:58:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:58:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 1 times [2022-04-08 14:58:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:57,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367287894] [2022-04-08 14:58:57,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:58:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 2 times [2022-04-08 14:58:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:58:57,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593399646] [2022-04-08 14:58:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:58:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:58:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:57,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:58:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:58:57,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-08 14:58:57,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-08 14:58:57,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-08 14:58:57,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {401623#true} call ULTIMATE.init(); {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:58:57,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-08 14:58:57,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-08 14:58:57,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-08 14:58:57,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {401623#true} call #t~ret16 := main(); {401623#true} is VALID [2022-04-08 14:58:57,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {401623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {401623#true} is VALID [2022-04-08 14:58:57,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {401623#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {401623#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {401623#true} assume !(0 != ~p1~0); {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {401623#true} assume !(0 != ~p2~0); {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {401623#true} assume !(0 != ~p3~0); {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {401623#true} assume !(0 != ~p4~0); {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {401623#true} assume !(0 != ~p5~0); {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {401623#true} assume !(0 != ~p6~0); {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {401623#true} assume !(0 != ~p7~0); {401623#true} is VALID [2022-04-08 14:58:57,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {401623#true} assume !(0 != ~p8~0); {401623#true} is VALID [2022-04-08 14:58:57,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {401623#true} assume !(0 != ~p9~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p10~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p1~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p2~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p3~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p4~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p5~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p6~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p7~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p8~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-08 14:58:57,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p9~0; {401624#false} is VALID [2022-04-08 14:58:57,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {401624#false} assume 1 != ~lk9~0; {401624#false} is VALID [2022-04-08 14:58:57,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {401624#false} assume !false; {401624#false} is VALID [2022-04-08 14:58:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:58:57,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:58:57,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593399646] [2022-04-08 14:58:57,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593399646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:57,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:57,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:57,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:58:57,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367287894] [2022-04-08 14:58:57,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367287894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:58:57,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:58:57,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:58:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770885770] [2022-04-08 14:58:57,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:58:57,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 14:58:57,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:58:57,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:58:57,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:58:57,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:58:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:58:57,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:58:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:58:57,525 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:59:39,304 INFO L93 Difference]: Finished difference Result 27917 states and 36233 transitions. [2022-04-08 14:59:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:59:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-08 14:59:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:59:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 14:59:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-08 14:59:39,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-08 14:59:39,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:59:52,378 INFO L225 Difference]: With dead ends: 27917 [2022-04-08 14:59:52,379 INFO L226 Difference]: Without dead ends: 15883 [2022-04-08 14:59:52,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:59:52,393 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:59:52,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:59:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-04-08 14:59:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-04-08 14:59:53,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:59:53,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:53,732 INFO L74 IsIncluded]: Start isIncluded. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 14:59:53,749 INFO L87 Difference]: Start difference. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:01,085 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-08 15:00:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-08 15:00:01,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:00:01,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:00:01,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15883 states. [2022-04-08 15:00:01,132 INFO L87 Difference]: Start difference. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15883 states. [2022-04-08 15:00:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:00:08,097 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-08 15:00:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-08 15:00:08,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:00:08,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:00:08,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:00:08,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:00:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-04-08 15:00:20,782 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-04-08 15:00:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:00:20,782 INFO L478 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-04-08 15:00:20,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:20,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15881 states and 20231 transitions. [2022-04-08 15:00:42,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:00:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-04-08 15:00:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 15:00:42,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:00:42,548 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:00:42,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:00:42,548 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:00:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:00:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 1 times [2022-04-08 15:00:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:42,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2104096014] [2022-04-08 15:00:42,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:00:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 2 times [2022-04-08 15:00:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:00:42,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919150488] [2022-04-08 15:00:42,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:00:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:00:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:00:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:42,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-08 15:00:42,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-08 15:00:42,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {520997#true} call ULTIMATE.init(); {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {520997#true} call #t~ret16 := main(); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {520997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {520997#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {520997#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {520997#true} assume !(0 != ~p1~0); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {520997#true} assume !(0 != ~p2~0); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {520997#true} assume !(0 != ~p3~0); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {520997#true} assume !(0 != ~p4~0); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {520997#true} assume !(0 != ~p5~0); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {520997#true} assume !(0 != ~p6~0); {520997#true} is VALID [2022-04-08 15:00:42,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {520997#true} assume !(0 != ~p7~0); {520997#true} is VALID [2022-04-08 15:00:42,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {520997#true} assume !(0 != ~p8~0); {520997#true} is VALID [2022-04-08 15:00:42,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {520997#true} assume 0 != ~p9~0;~lk9~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {521002#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-08 15:00:42,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {520998#false} is VALID [2022-04-08 15:00:42,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {520998#false} assume 0 != ~p10~0; {520998#false} is VALID [2022-04-08 15:00:42,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {520998#false} assume 1 != ~lk10~0; {520998#false} is VALID [2022-04-08 15:00:42,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {520998#false} assume !false; {520998#false} is VALID [2022-04-08 15:00:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:00:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:00:42,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919150488] [2022-04-08 15:00:42,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919150488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:42,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:42,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:00:42,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:00:42,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2104096014] [2022-04-08 15:00:42,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2104096014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:42,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:42,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:00:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271395168] [2022-04-08 15:00:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:00:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 15:00:42,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:00:42,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:00:42,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:00:42,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:00:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:42,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:00:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:00:42,615 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:09,849 INFO L93 Difference]: Finished difference Result 23821 states and 30217 transitions. [2022-04-08 15:01:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:01:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 15:01:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:01:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 15:01:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-08 15:01:09,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-08 15:01:09,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:01:22,408 INFO L225 Difference]: With dead ends: 23821 [2022-04-08 15:01:22,408 INFO L226 Difference]: Without dead ends: 16139 [2022-04-08 15:01:22,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:01:22,420 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:01:22,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:01:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-04-08 15:01:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-04-08 15:01:23,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:01:23,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:23,875 INFO L74 IsIncluded]: Start isIncluded. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:23,894 INFO L87 Difference]: Start difference. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:31,705 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-08 15:01:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-08 15:01:31,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:31,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:31,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16139 states. [2022-04-08 15:01:31,747 INFO L87 Difference]: Start difference. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16139 states. [2022-04-08 15:01:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:39,937 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-08 15:01:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-08 15:01:39,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:39,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:39,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:01:39,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:01:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-04-08 15:01:54,055 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-04-08 15:01:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:01:54,055 INFO L478 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-04-08 15:01:54,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:01:54,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16137 states and 20231 transitions. [2022-04-08 15:02:15,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-04-08 15:02:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 15:02:15,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:02:15,734 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:02:15,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 15:02:15,734 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:02:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:02:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 1 times [2022-04-08 15:02:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:02:15,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1040065592] [2022-04-08 15:02:15,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:02:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 2 times [2022-04-08 15:02:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:02:15,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353057722] [2022-04-08 15:02:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:02:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:02:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:02:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:15,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-08 15:02:15,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-08 15:02:15,765 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {633203#true} call ULTIMATE.init(); {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {633203#true} call #t~ret16 := main(); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {633203#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {633203#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {633203#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {633203#true} assume !(0 != ~p1~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {633203#true} assume !(0 != ~p2~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {633203#true} assume !(0 != ~p3~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {633203#true} assume !(0 != ~p4~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {633203#true} assume !(0 != ~p5~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {633203#true} assume !(0 != ~p6~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {633203#true} assume !(0 != ~p7~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {633203#true} assume !(0 != ~p8~0); {633203#true} is VALID [2022-04-08 15:02:15,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {633203#true} assume !(0 != ~p9~0); {633203#true} is VALID [2022-04-08 15:02:15,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {633203#true} assume !(0 != ~p10~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p1~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p2~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p3~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p4~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p5~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p6~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p7~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p8~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p9~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-08 15:02:15,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p10~0; {633204#false} is VALID [2022-04-08 15:02:15,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {633204#false} assume 1 != ~lk10~0; {633204#false} is VALID [2022-04-08 15:02:15,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {633204#false} assume !false; {633204#false} is VALID [2022-04-08 15:02:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:02:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:02:15,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353057722] [2022-04-08 15:02:15,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353057722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:02:15,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:02:15,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:02:15,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:02:15,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1040065592] [2022-04-08 15:02:15,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1040065592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:02:15,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:02:15,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:02:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713548477] [2022-04-08 15:02:15,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:02:15,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 15:02:15,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:02:15,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:02:15,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:15,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:02:15,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:02:15,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:02:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:02:15,785 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:06:26,896 INFO L93 Difference]: Finished difference Result 46861 states and 57609 transitions. [2022-04-08 15:06:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:06:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 15:06:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:06:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 15:06:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:06:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-08 15:06:26,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-08 15:06:26,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:07:18,524 INFO L225 Difference]: With dead ends: 46861 [2022-04-08 15:07:18,524 INFO L226 Difference]: Without dead ends: 31243 [2022-04-08 15:07:18,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:07:18,547 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:07:18,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 93 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 15:07:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2022-04-08 15:07:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2022-04-08 15:07:21,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:07:21,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:07:21,308 INFO L74 IsIncluded]: Start isIncluded. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:07:21,343 INFO L87 Difference]: Start difference. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:07:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:07:53,486 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-08 15:07:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-08 15:07:53,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:07:53,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:07:53,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31243 states. [2022-04-08 15:07:53,588 INFO L87 Difference]: Start difference. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31243 states. [2022-04-08 15:08:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:08:30,236 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-08 15:08:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-08 15:08:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:08:30,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:08:30,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:08:30,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:08:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:09:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 37383 transitions. [2022-04-08 15:09:38,915 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 37383 transitions. Word has length 31 [2022-04-08 15:09:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:09:38,915 INFO L478 AbstractCegarLoop]: Abstraction has 31241 states and 37383 transitions. [2022-04-08 15:09:38,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:09:38,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31241 states and 37383 transitions.