/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:16:04,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:16:04,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:16:04,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:16:04,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:16:04,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:16:04,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:16:04,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:16:04,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:16:04,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:16:04,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:16:04,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:16:04,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:16:04,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:16:04,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:16:04,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:16:04,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:16:04,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:16:04,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:16:04,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:16:04,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:16:04,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:16:04,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:16:04,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:16:04,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:16:04,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:16:04,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:16:04,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:16:04,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:16:04,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:16:04,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:16:04,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:16:04,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:16:04,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:16:04,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:16:04,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:16:04,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:16:04,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:16:04,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:16:04,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:16:04,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:16:04,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:16:04,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:16:04,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:16:04,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:16:04,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:16:04,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:16:04,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:16:04,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:16:04,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:16:04,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:16:04,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:16:04,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:16:04,220 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:16:04,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:16:04,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:16:04,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:16:04,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:16:04,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:16:04,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:16:04,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:16:04,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:04,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:16:04,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:16:04,221 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:16:04,221 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:16:04,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:16:04,222 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:16:04,222 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-28 08:16:04,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:16:04,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:16:04,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:16:04,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:16:04,460 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:16:04,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-04-28 08:16:04,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc24204a/e2d9ced06d8645f1918b4e7e1ab8aed4/FLAG3129f36b3 [2022-04-28 08:16:04,813 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:16:04,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-28 08:16:04,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc24204a/e2d9ced06d8645f1918b4e7e1ab8aed4/FLAG3129f36b3 [2022-04-28 08:16:05,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dc24204a/e2d9ced06d8645f1918b4e7e1ab8aed4 [2022-04-28 08:16:05,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:16:05,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:16:05,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:05,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:16:05,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:16:05,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58cf8d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05, skipping insertion in model container [2022-04-28 08:16:05,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:16:05,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:16:05,440 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_12.c[4591,4604] [2022-04-28 08:16:05,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:05,451 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:16:05,478 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_12.c[4591,4604] [2022-04-28 08:16:05,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:05,490 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:16:05,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05 WrapperNode [2022-04-28 08:16:05,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:05,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:16:05,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:16:05,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:16:05,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:16:05,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:16:05,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:16:05,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:16:05,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (1/1) ... [2022-04-28 08:16:05,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:05,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:16:05,556 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-28 08:16:05,567 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-28 08:16:05,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:16:05,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:16:05,590 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:16:05,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:16:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:16:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:16:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:16:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:16:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:16:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:16:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:16:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:16:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:16:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:16:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:16:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:16:05,642 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:16:05,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:16:05,926 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:16:05,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:16:05,933 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:16:05,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:05 BoogieIcfgContainer [2022-04-28 08:16:05,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:16:05,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:16:05,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:16:05,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:16:05,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:16:05" (1/3) ... [2022-04-28 08:16:05,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaf024e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:05, skipping insertion in model container [2022-04-28 08:16:05,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:05" (2/3) ... [2022-04-28 08:16:05,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaf024e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:05, skipping insertion in model container [2022-04-28 08:16:05,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:05" (3/3) ... [2022-04-28 08:16:05,942 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-04-28 08:16:05,953 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:16:05,953 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:16:05,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:16:05,994 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b6f4d92, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cf86beb [2022-04-28 08:16:05,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:16:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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-28 08:16:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:16:06,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:06,010 INFO L195 NwaCegarLoop]: 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-28 08:16:06,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 1 times [2022-04-28 08:16:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:06,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273576943] [2022-04-28 08:16:06,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 2 times [2022-04-28 08:16:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:06,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557044033] [2022-04-28 08:16:06,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:06,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:06,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(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); {54#true} is VALID [2022-04-28 08:16:06,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-28 08:16:06,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-28 08:16:06,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:06,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(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); {54#true} is VALID [2022-04-28 08:16:06,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-28 08:16:06,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-28 08:16:06,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret17 := main(); {54#true} is VALID [2022-04-28 08:16:06,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {54#true} is VALID [2022-04-28 08:16:06,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {54#true} is VALID [2022-04-28 08:16:06,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {54#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;~lk12~0 := 0; {54#true} is VALID [2022-04-28 08:16:06,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {54#true} assume 0 != ~p1~0;~lk1~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#(= main_~lk1~0 1)} assume 0 != ~p1~0; {59#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:06,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {55#false} is VALID [2022-04-28 08:16:06,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-28 08:16:06,376 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-28 08:16:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:06,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557044033] [2022-04-28 08:16:06,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557044033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:06,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:06,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:06,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:06,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273576943] [2022-04-28 08:16:06,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273576943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:06,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:06,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:06,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595083065] [2022-04-28 08:16:06,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:06,387 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-28 08:16:06,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:06,392 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-28 08:16:06,426 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-28 08:16:06,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:06,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:06,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:06,458 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 46 states have internal predecessors, (85), 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 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-28 08:16:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:06,902 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2022-04-28 08:16:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:06,902 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-28 08:16:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:06,904 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-28 08:16:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 08:16:06,913 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-28 08:16:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 08:16:06,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-28 08:16:07,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,115 INFO L225 Difference]: With dead ends: 100 [2022-04-28 08:16:07,115 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 08:16:07,118 INFO L412 NwaCegarLoop]: 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-28 08:16:07,122 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 208 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:07,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 101 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 08:16:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-28 08:16:07,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:07,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-28 08:16:07,161 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-28 08:16:07,162 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-28 08:16:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,169 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-28 08:16:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-28 08:16:07,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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 85 states. [2022-04-28 08:16:07,172 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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 85 states. [2022-04-28 08:16:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,178 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-28 08:16:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-28 08:16:07,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:07,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8727272727272728) internal successors, (103), 55 states have internal predecessors, (103), 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-28 08:16:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-28 08:16:07,184 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-28 08:16:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:07,185 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-28 08:16:07,185 INFO L496 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-28 08:16:07,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 106 transitions. [2022-04-28 08:16:07,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-28 08:16:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:16:07,289 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:07,290 INFO L195 NwaCegarLoop]: 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-28 08:16:07,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:16:07,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 1 times [2022-04-28 08:16:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658162564] [2022-04-28 08:16:07,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 2 times [2022-04-28 08:16:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:07,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077255100] [2022-04-28 08:16:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#(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); {554#true} is VALID [2022-04-28 08:16:07,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 08:16:07,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-28 08:16:07,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:07,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#(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); {554#true} is VALID [2022-04-28 08:16:07,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 08:16:07,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-28 08:16:07,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret17 := main(); {554#true} is VALID [2022-04-28 08:16:07,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {554#true} is VALID [2022-04-28 08:16:07,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {554#true} is VALID [2022-04-28 08:16:07,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#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;~lk12~0 := 0; {554#true} is VALID [2022-04-28 08:16:07,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 != ~p1~0); {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p2~0); {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {559#(= main_~p1~0 0)} assume !(0 != ~p10~0); {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {559#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:07,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p1~0; {555#false} is VALID [2022-04-28 08:16:07,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#false} assume 1 != ~lk1~0; {555#false} is VALID [2022-04-28 08:16:07,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-28 08:16:07,400 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-28 08:16:07,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:07,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077255100] [2022-04-28 08:16:07,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077255100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:07,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658162564] [2022-04-28 08:16:07,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658162564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26328945] [2022-04-28 08:16:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:07,403 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-28 08:16:07,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:07,403 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-28 08:16:07,422 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-28 08:16:07,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:07,424 INFO L87 Difference]: Start difference. First operand 59 states and 106 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-28 08:16:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,695 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions. [2022-04-28 08:16:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:07,695 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-28 08:16:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:07,696 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-28 08:16:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-28 08:16:07,699 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-28 08:16:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-28 08:16:07,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-28 08:16:07,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,894 INFO L225 Difference]: With dead ends: 138 [2022-04-28 08:16:07,894 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 08:16:07,894 INFO L412 NwaCegarLoop]: 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-28 08:16:07,896 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:07,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 08:16:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-28 08:16:07,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:07,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-28 08:16:07,910 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-28 08:16:07,910 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-28 08:16:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,914 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-28 08:16:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-28 08:16:07,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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 85 states. [2022-04-28 08:16:07,915 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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 85 states. [2022-04-28 08:16:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,919 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-28 08:16:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-28 08:16:07,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:07,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.860759493670886) internal successors, (147), 79 states have internal predecessors, (147), 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-28 08:16:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-28 08:16:07,923 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-28 08:16:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:07,923 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-28 08:16:07,924 INFO L496 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-28 08:16:07,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 150 transitions. [2022-04-28 08:16:08,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-28 08:16:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:16:08,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:08,076 INFO L195 NwaCegarLoop]: 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-28 08:16:08,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:16:08,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 1 times [2022-04-28 08:16:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1807160094] [2022-04-28 08:16:08,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:08,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 2 times [2022-04-28 08:16:08,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:08,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255984756] [2022-04-28 08:16:08,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(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); {1178#true} is VALID [2022-04-28 08:16:08,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 08:16:08,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-28 08:16:08,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:08,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(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); {1178#true} is VALID [2022-04-28 08:16:08,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 08:16:08,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-28 08:16:08,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret17 := main(); {1178#true} is VALID [2022-04-28 08:16:08,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {1178#true} is VALID [2022-04-28 08:16:08,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1178#true} is VALID [2022-04-28 08:16:08,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#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;~lk12~0 := 0; {1178#true} is VALID [2022-04-28 08:16:08,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume 0 != ~p1~0;~lk1~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {1183#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {1183#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:08,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1179#false} is VALID [2022-04-28 08:16:08,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#false} assume 0 != ~p2~0; {1179#false} is VALID [2022-04-28 08:16:08,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#false} assume 1 != ~lk2~0; {1179#false} is VALID [2022-04-28 08:16:08,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 08:16:08,178 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-28 08:16:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255984756] [2022-04-28 08:16:08,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255984756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:08,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1807160094] [2022-04-28 08:16:08,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1807160094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788746089] [2022-04-28 08:16:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:08,180 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-28 08:16:08,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:08,181 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-28 08:16:08,198 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-28 08:16:08,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:08,199 INFO L87 Difference]: Start difference. First operand 83 states and 150 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-28 08:16:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,422 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2022-04-28 08:16:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:08,422 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-28 08:16:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:08,423 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-28 08:16:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-28 08:16:08,426 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-28 08:16:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-28 08:16:08,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-28 08:16:08,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,589 INFO L225 Difference]: With dead ends: 127 [2022-04-28 08:16:08,589 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 08:16:08,589 INFO L412 NwaCegarLoop]: 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-28 08:16:08,590 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:08,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 08:16:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-28 08:16:08,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:08,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-28 08:16:08,604 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-28 08:16:08,604 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-28 08:16:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,607 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-28 08:16:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-28 08:16:08,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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 88 states. [2022-04-28 08:16:08,608 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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 88 states. [2022-04-28 08:16:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,611 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-28 08:16:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-28 08:16:08,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:08,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 82 states have internal predecessors, (149), 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-28 08:16:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-28 08:16:08,616 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-28 08:16:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:08,616 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-28 08:16:08,616 INFO L496 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-28 08:16:08,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 152 transitions. [2022-04-28 08:16:08,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-28 08:16:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:16:08,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:08,759 INFO L195 NwaCegarLoop]: 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-28 08:16:08,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:16:08,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 1 times [2022-04-28 08:16:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326142594] [2022-04-28 08:16:08,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 2 times [2022-04-28 08:16:08,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:08,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099917901] [2022-04-28 08:16:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:08,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#(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); {1792#true} is VALID [2022-04-28 08:16:08,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 08:16:08,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-28 08:16:08,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:08,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#(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); {1792#true} is VALID [2022-04-28 08:16:08,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 08:16:08,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-28 08:16:08,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret17 := main(); {1792#true} is VALID [2022-04-28 08:16:08,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {1792#true} is VALID [2022-04-28 08:16:08,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {1792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {1792#true} is VALID [2022-04-28 08:16:08,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#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;~lk12~0 := 0; {1792#true} is VALID [2022-04-28 08:16:08,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 != ~p1~0); {1792#true} is VALID [2022-04-28 08:16:08,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume !(0 != ~p2~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {1797#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:08,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p2~0; {1793#false} is VALID [2022-04-28 08:16:08,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} assume 1 != ~lk2~0; {1793#false} is VALID [2022-04-28 08:16:08,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-28 08:16:08,865 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-28 08:16:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099917901] [2022-04-28 08:16:08,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099917901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:08,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326142594] [2022-04-28 08:16:08,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326142594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536630980] [2022-04-28 08:16:08,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:08,867 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-28 08:16:08,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:08,867 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-28 08:16:08,884 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-28 08:16:08,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:08,885 INFO L87 Difference]: Start difference. First operand 86 states and 152 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-28 08:16:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,126 INFO L93 Difference]: Finished difference Result 238 states and 432 transitions. [2022-04-28 08:16:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:09,126 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-28 08:16:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:09,127 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-28 08:16:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-28 08:16:09,129 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-28 08:16:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-28 08:16:09,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-28 08:16:09,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,298 INFO L225 Difference]: With dead ends: 238 [2022-04-28 08:16:09,298 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 08:16:09,299 INFO L412 NwaCegarLoop]: 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-28 08:16:09,300 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:09,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 91 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 08:16:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-28 08:16:09,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:09,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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-28 08:16:09,317 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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-28 08:16:09,318 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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-28 08:16:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,323 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-28 08:16:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-28 08:16:09,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:09,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:09,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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 161 states. [2022-04-28 08:16:09,325 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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 161 states. [2022-04-28 08:16:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,331 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-28 08:16:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-28 08:16:09,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:09,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:09,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:09,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8193548387096774) internal successors, (282), 155 states have internal predecessors, (282), 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-28 08:16:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 285 transitions. [2022-04-28 08:16:09,338 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 285 transitions. Word has length 24 [2022-04-28 08:16:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:09,338 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 285 transitions. [2022-04-28 08:16:09,338 INFO L496 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-28 08:16:09,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 285 transitions. [2022-04-28 08:16:09,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions. [2022-04-28 08:16:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:16:09,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:09,616 INFO L195 NwaCegarLoop]: 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-28 08:16:09,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:16:09,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 1 times [2022-04-28 08:16:09,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1524602912] [2022-04-28 08:16:09,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 2 times [2022-04-28 08:16:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:09,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004757405] [2022-04-28 08:16:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:09,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {2926#(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); {2920#true} is VALID [2022-04-28 08:16:09,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-28 08:16:09,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-28 08:16:09,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {2920#true} call ULTIMATE.init(); {2926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:09,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2926#(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); {2920#true} is VALID [2022-04-28 08:16:09,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-28 08:16:09,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-28 08:16:09,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {2920#true} call #t~ret17 := main(); {2920#true} is VALID [2022-04-28 08:16:09,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {2920#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {2920#true} is VALID [2022-04-28 08:16:09,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {2920#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {2920#true} is VALID [2022-04-28 08:16:09,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {2920#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;~lk12~0 := 0; {2920#true} is VALID [2022-04-28 08:16:09,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {2920#true} assume !(0 != ~p1~0); {2920#true} is VALID [2022-04-28 08:16:09,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {2920#true} assume 0 != ~p2~0;~lk2~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {2925#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {2925#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2925#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:09,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {2925#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2921#false} is VALID [2022-04-28 08:16:09,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {2921#false} assume !false; {2921#false} is VALID [2022-04-28 08:16:09,688 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-28 08:16:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:09,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004757405] [2022-04-28 08:16:09,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004757405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:09,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1524602912] [2022-04-28 08:16:09,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1524602912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695591371] [2022-04-28 08:16:09,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:09,690 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-28 08:16:09,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:09,690 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-28 08:16:09,710 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-28 08:16:09,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:09,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:09,711 INFO L87 Difference]: Start difference. First operand 159 states and 285 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-28 08:16:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,902 INFO L93 Difference]: Finished difference Result 207 states and 371 transitions. [2022-04-28 08:16:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:09,903 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-28 08:16:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:09,903 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-28 08:16:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 08:16:09,905 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-28 08:16:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 08:16:09,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 08:16:10,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,032 INFO L225 Difference]: With dead ends: 207 [2022-04-28 08:16:10,032 INFO L226 Difference]: Without dead ends: 205 [2022-04-28 08:16:10,032 INFO L412 NwaCegarLoop]: 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-28 08:16:10,033 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:10,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 152 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-28 08:16:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2022-04-28 08:16:10,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:10,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-28 08:16:10,050 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-28 08:16:10,050 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-28 08:16:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,061 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-28 08:16:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-28 08:16:10,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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 205 states. [2022-04-28 08:16:10,063 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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 205 states. [2022-04-28 08:16:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,075 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-28 08:16:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-28 08:16:10,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:10,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.8064516129032258) internal successors, (280), 155 states have internal predecessors, (280), 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-28 08:16:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-28 08:16:10,084 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-28 08:16:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:10,084 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-28 08:16:10,084 INFO L496 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-28 08:16:10,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 283 transitions. [2022-04-28 08:16:10,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-28 08:16:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:10,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:10,360 INFO L195 NwaCegarLoop]: 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-28 08:16:10,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:16:10,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 1 times [2022-04-28 08:16:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:10,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2005831291] [2022-04-28 08:16:10,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 2 times [2022-04-28 08:16:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:10,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766820935] [2022-04-28 08:16:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:10,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {4080#(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); {4074#true} is VALID [2022-04-28 08:16:10,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-28 08:16:10,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-28 08:16:10,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {4074#true} call ULTIMATE.init(); {4080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:10,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#(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); {4074#true} is VALID [2022-04-28 08:16:10,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-28 08:16:10,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-28 08:16:10,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {4074#true} call #t~ret17 := main(); {4074#true} is VALID [2022-04-28 08:16:10,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {4074#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {4074#true} is VALID [2022-04-28 08:16:10,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {4074#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {4074#true} is VALID [2022-04-28 08:16:10,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {4074#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;~lk12~0 := 0; {4074#true} is VALID [2022-04-28 08:16:10,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {4074#true} assume !(0 != ~p1~0); {4074#true} is VALID [2022-04-28 08:16:10,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {4074#true} assume !(0 != ~p2~0); {4074#true} is VALID [2022-04-28 08:16:10,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {4074#true} assume 0 != ~p3~0;~lk3~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {4079#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {4079#(= main_~lk3~0 1)} assume 0 != ~p3~0; {4079#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:10,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {4079#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4075#false} is VALID [2022-04-28 08:16:10,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {4075#false} assume !false; {4075#false} is VALID [2022-04-28 08:16:10,412 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-28 08:16:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:10,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766820935] [2022-04-28 08:16:10,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766820935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:10,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:10,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:10,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:10,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2005831291] [2022-04-28 08:16:10,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2005831291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:10,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:10,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320404447] [2022-04-28 08:16:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:10,413 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-28 08:16:10,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:10,414 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-28 08:16:10,430 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-28 08:16:10,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:10,431 INFO L87 Difference]: Start difference. First operand 159 states and 283 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-28 08:16:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,651 INFO L93 Difference]: Finished difference Result 299 states and 539 transitions. [2022-04-28 08:16:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:10,651 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-28 08:16:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:10,651 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-28 08:16:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:16:10,654 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-28 08:16:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 08:16:10,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 08:16:10,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,778 INFO L225 Difference]: With dead ends: 299 [2022-04-28 08:16:10,778 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 08:16:10,778 INFO L412 NwaCegarLoop]: 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-28 08:16:10,779 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:10,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 08:16:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-04-28 08:16:10,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:10,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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-28 08:16:10,801 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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-28 08:16:10,802 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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-28 08:16:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,811 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-28 08:16:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-28 08:16:10,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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 297 states. [2022-04-28 08:16:10,814 INFO L87 Difference]: Start difference. First operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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 297 states. [2022-04-28 08:16:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,823 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-28 08:16:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-28 08:16:10,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:10,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 211 states have (on average 1.7914691943127963) internal successors, (378), 211 states have internal predecessors, (378), 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-28 08:16:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 381 transitions. [2022-04-28 08:16:10,831 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 381 transitions. Word has length 25 [2022-04-28 08:16:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:10,831 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 381 transitions. [2022-04-28 08:16:10,831 INFO L496 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-28 08:16:10,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 381 transitions. [2022-04-28 08:16:11,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 381 transitions. [2022-04-28 08:16:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:11,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:11,182 INFO L195 NwaCegarLoop]: 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-28 08:16:11,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:16:11,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 1 times [2022-04-28 08:16:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:11,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [19926486] [2022-04-28 08:16:11,183 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 2 times [2022-04-28 08:16:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:11,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448015161] [2022-04-28 08:16:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:11,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:11,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {5714#(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); {5708#true} is VALID [2022-04-28 08:16:11,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-28 08:16:11,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-28 08:16:11,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {5708#true} call ULTIMATE.init(); {5714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:11,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {5714#(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); {5708#true} is VALID [2022-04-28 08:16:11,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-28 08:16:11,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-28 08:16:11,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {5708#true} call #t~ret17 := main(); {5708#true} is VALID [2022-04-28 08:16:11,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {5708#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {5708#true} is VALID [2022-04-28 08:16:11,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {5708#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {5708#true} is VALID [2022-04-28 08:16:11,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#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;~lk12~0 := 0; {5708#true} is VALID [2022-04-28 08:16:11,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {5708#true} assume !(0 != ~p1~0); {5708#true} is VALID [2022-04-28 08:16:11,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {5708#true} assume !(0 != ~p2~0); {5708#true} is VALID [2022-04-28 08:16:11,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {5708#true} assume !(0 != ~p3~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {5713#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:11,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p3~0; {5709#false} is VALID [2022-04-28 08:16:11,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {5709#false} assume 1 != ~lk3~0; {5709#false} is VALID [2022-04-28 08:16:11,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {5709#false} assume !false; {5709#false} is VALID [2022-04-28 08:16:11,235 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-28 08:16:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:11,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448015161] [2022-04-28 08:16:11,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448015161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:11,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:11,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:11,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:11,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [19926486] [2022-04-28 08:16:11,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [19926486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:11,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:11,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548719643] [2022-04-28 08:16:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:11,236 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-28 08:16:11,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:11,237 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-28 08:16:11,252 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-28 08:16:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:11,253 INFO L87 Difference]: Start difference. First operand 215 states and 381 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-28 08:16:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,497 INFO L93 Difference]: Finished difference Result 511 states and 915 transitions. [2022-04-28 08:16:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:11,497 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-28 08:16:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:11,498 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-28 08:16:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-28 08:16:11,500 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-28 08:16:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-28 08:16:11,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-28 08:16:11,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:11,666 INFO L225 Difference]: With dead ends: 511 [2022-04-28 08:16:11,666 INFO L226 Difference]: Without dead ends: 305 [2022-04-28 08:16:11,667 INFO L412 NwaCegarLoop]: 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-28 08:16:11,667 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:11,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 115 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-28 08:16:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2022-04-28 08:16:11,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:11,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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-28 08:16:11,694 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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-28 08:16:11,695 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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-28 08:16:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,703 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-28 08:16:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-28 08:16:11,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:11,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:11,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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 305 states. [2022-04-28 08:16:11,705 INFO L87 Difference]: Start difference. First operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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 305 states. [2022-04-28 08:16:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,713 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-28 08:16:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-28 08:16:11,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:11,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:11,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.7792642140468227) internal successors, (532), 299 states have internal predecessors, (532), 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-28 08:16:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 535 transitions. [2022-04-28 08:16:11,724 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 535 transitions. Word has length 25 [2022-04-28 08:16:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:11,725 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 535 transitions. [2022-04-28 08:16:11,725 INFO L496 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-28 08:16:11,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 535 transitions. [2022-04-28 08:16:12,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 535 transitions. [2022-04-28 08:16:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:12,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:12,210 INFO L195 NwaCegarLoop]: 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-28 08:16:12,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:16:12,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 1 times [2022-04-28 08:16:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:12,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [602004509] [2022-04-28 08:16:12,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 2 times [2022-04-28 08:16:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:12,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547144372] [2022-04-28 08:16:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:12,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {7964#(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); {7958#true} is VALID [2022-04-28 08:16:12,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-28 08:16:12,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-28 08:16:12,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {7958#true} call ULTIMATE.init(); {7964#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:12,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {7964#(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); {7958#true} is VALID [2022-04-28 08:16:12,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-28 08:16:12,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-28 08:16:12,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {7958#true} call #t~ret17 := main(); {7958#true} is VALID [2022-04-28 08:16:12,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {7958#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {7958#true} is VALID [2022-04-28 08:16:12,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {7958#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {7958#true} is VALID [2022-04-28 08:16:12,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {7958#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;~lk12~0 := 0; {7958#true} is VALID [2022-04-28 08:16:12,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {7958#true} assume !(0 != ~p1~0); {7958#true} is VALID [2022-04-28 08:16:12,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#true} assume !(0 != ~p2~0); {7958#true} is VALID [2022-04-28 08:16:12,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {7958#true} assume 0 != ~p3~0;~lk3~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {7963#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7963#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:12,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7959#false} is VALID [2022-04-28 08:16:12,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {7959#false} assume 0 != ~p4~0; {7959#false} is VALID [2022-04-28 08:16:12,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {7959#false} assume 1 != ~lk4~0; {7959#false} is VALID [2022-04-28 08:16:12,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {7959#false} assume !false; {7959#false} is VALID [2022-04-28 08:16:12,270 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-28 08:16:12,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:12,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547144372] [2022-04-28 08:16:12,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547144372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:12,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:12,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:12,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:12,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [602004509] [2022-04-28 08:16:12,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [602004509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:12,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:12,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120323152] [2022-04-28 08:16:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:12,271 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-28 08:16:12,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:12,272 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-28 08:16:12,289 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-28 08:16:12,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:12,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:12,290 INFO L87 Difference]: Start difference. First operand 303 states and 535 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-28 08:16:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,539 INFO L93 Difference]: Finished difference Result 457 states and 805 transitions. [2022-04-28 08:16:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:12,540 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-28 08:16:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:12,540 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-28 08:16:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-28 08:16:12,542 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-28 08:16:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-28 08:16:12,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-28 08:16:12,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:12,697 INFO L225 Difference]: With dead ends: 457 [2022-04-28 08:16:12,697 INFO L226 Difference]: Without dead ends: 311 [2022-04-28 08:16:12,698 INFO L412 NwaCegarLoop]: 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-28 08:16:12,699 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:12,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 127 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-28 08:16:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-28 08:16:12,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:12,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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-28 08:16:12,725 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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-28 08:16:12,726 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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-28 08:16:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,733 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-28 08:16:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-28 08:16:12,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:12,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:12,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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 311 states. [2022-04-28 08:16:12,736 INFO L87 Difference]: Start difference. First operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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 311 states. [2022-04-28 08:16:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,744 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-28 08:16:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-28 08:16:12,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:12,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:12,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:12,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 305 states have (on average 1.7573770491803278) internal successors, (536), 305 states have internal predecessors, (536), 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-28 08:16:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 539 transitions. [2022-04-28 08:16:12,754 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 539 transitions. Word has length 26 [2022-04-28 08:16:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:12,755 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 539 transitions. [2022-04-28 08:16:12,755 INFO L496 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-28 08:16:12,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 539 transitions. [2022-04-28 08:16:13,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 539 transitions. [2022-04-28 08:16:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:13,282 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:13,282 INFO L195 NwaCegarLoop]: 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-28 08:16:13,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:16:13,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 1 times [2022-04-28 08:16:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:13,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [571697010] [2022-04-28 08:16:13,283 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 2 times [2022-04-28 08:16:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:13,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082786041] [2022-04-28 08:16:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:13,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {10130#(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); {10124#true} is VALID [2022-04-28 08:16:13,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 08:16:13,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-28 08:16:13,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:13,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {10130#(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); {10124#true} is VALID [2022-04-28 08:16:13,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 08:16:13,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-28 08:16:13,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret17 := main(); {10124#true} is VALID [2022-04-28 08:16:13,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {10124#true} is VALID [2022-04-28 08:16:13,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {10124#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {10124#true} is VALID [2022-04-28 08:16:13,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#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;~lk12~0 := 0; {10124#true} is VALID [2022-04-28 08:16:13,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 != ~p1~0); {10124#true} is VALID [2022-04-28 08:16:13,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume !(0 != ~p2~0); {10124#true} is VALID [2022-04-28 08:16:13,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {10124#true} assume !(0 != ~p3~0); {10124#true} is VALID [2022-04-28 08:16:13,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {10124#true} assume 0 != ~p4~0;~lk4~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {10129#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {10129#(= main_~lk4~0 1)} assume 0 != ~p4~0; {10129#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:13,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {10129#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10125#false} is VALID [2022-04-28 08:16:13,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-28 08:16:13,339 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-28 08:16:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:13,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082786041] [2022-04-28 08:16:13,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082786041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:13,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:13,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:13,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:13,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [571697010] [2022-04-28 08:16:13,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [571697010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:13,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:13,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777540338] [2022-04-28 08:16:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:13,341 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-28 08:16:13,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:13,341 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-28 08:16:13,358 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-28 08:16:13,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:13,359 INFO L87 Difference]: Start difference. First operand 309 states and 539 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-28 08:16:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,611 INFO L93 Difference]: Finished difference Result 573 states and 1013 transitions. [2022-04-28 08:16:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:13,612 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-28 08:16:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:13,612 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-28 08:16:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-28 08:16:13,614 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-28 08:16:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-28 08:16:13,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-28 08:16:13,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:13,755 INFO L225 Difference]: With dead ends: 573 [2022-04-28 08:16:13,756 INFO L226 Difference]: Without dead ends: 571 [2022-04-28 08:16:13,756 INFO L412 NwaCegarLoop]: 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-28 08:16:13,757 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:13,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 87 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-28 08:16:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-28 08:16:13,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:13,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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-28 08:16:13,789 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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-28 08:16:13,790 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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-28 08:16:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,810 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-28 08:16:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-28 08:16:13,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:13,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:13,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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 571 states. [2022-04-28 08:16:13,813 INFO L87 Difference]: Start difference. First operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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 571 states. [2022-04-28 08:16:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,835 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-28 08:16:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-28 08:16:13,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:13,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:13,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:13,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 421 states have (on average 1.7292161520190024) internal successors, (728), 421 states have internal predecessors, (728), 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-28 08:16:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 731 transitions. [2022-04-28 08:16:13,853 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 731 transitions. Word has length 26 [2022-04-28 08:16:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:13,853 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 731 transitions. [2022-04-28 08:16:13,853 INFO L496 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-28 08:16:13,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 425 states and 731 transitions. [2022-04-28 08:16:14,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 731 transitions. [2022-04-28 08:16:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:14,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:14,525 INFO L195 NwaCegarLoop]: 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-28 08:16:14,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:16:14,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 1 times [2022-04-28 08:16:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:14,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677264423] [2022-04-28 08:16:14,526 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 2 times [2022-04-28 08:16:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:14,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570614649] [2022-04-28 08:16:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:14,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {13280#(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); {13274#true} is VALID [2022-04-28 08:16:14,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-28 08:16:14,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-28 08:16:14,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {13274#true} call ULTIMATE.init(); {13280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:14,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {13280#(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); {13274#true} is VALID [2022-04-28 08:16:14,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-28 08:16:14,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-28 08:16:14,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {13274#true} call #t~ret17 := main(); {13274#true} is VALID [2022-04-28 08:16:14,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {13274#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {13274#true} is VALID [2022-04-28 08:16:14,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {13274#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {13274#true} is VALID [2022-04-28 08:16:14,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {13274#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;~lk12~0 := 0; {13274#true} is VALID [2022-04-28 08:16:14,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {13274#true} assume !(0 != ~p1~0); {13274#true} is VALID [2022-04-28 08:16:14,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {13274#true} assume !(0 != ~p2~0); {13274#true} is VALID [2022-04-28 08:16:14,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {13274#true} assume !(0 != ~p3~0); {13274#true} is VALID [2022-04-28 08:16:14,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {13274#true} assume !(0 != ~p4~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p10~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p1~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p2~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {13279#(= main_~p4~0 0)} assume !(0 != ~p3~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:14,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p4~0; {13275#false} is VALID [2022-04-28 08:16:14,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {13275#false} assume 1 != ~lk4~0; {13275#false} is VALID [2022-04-28 08:16:14,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {13275#false} assume !false; {13275#false} is VALID [2022-04-28 08:16:14,594 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-28 08:16:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:14,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570614649] [2022-04-28 08:16:14,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570614649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:14,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:14,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:14,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:14,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677264423] [2022-04-28 08:16:14,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677264423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:14,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:14,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:14,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023882192] [2022-04-28 08:16:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:14,596 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-28 08:16:14,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:14,596 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-28 08:16:14,613 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-28 08:16:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:14,614 INFO L87 Difference]: Start difference. First operand 425 states and 731 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-28 08:16:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:14,928 INFO L93 Difference]: Finished difference Result 1005 states and 1741 transitions. [2022-04-28 08:16:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:14,928 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-28 08:16:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:14,929 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-28 08:16:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-28 08:16:14,931 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-28 08:16:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-28 08:16:14,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2022-04-28 08:16:15,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:15,098 INFO L225 Difference]: With dead ends: 1005 [2022-04-28 08:16:15,098 INFO L226 Difference]: Without dead ends: 595 [2022-04-28 08:16:15,099 INFO L412 NwaCegarLoop]: 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-28 08:16:15,100 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:15,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-28 08:16:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-28 08:16:15,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:15,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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-28 08:16:15,146 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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-28 08:16:15,148 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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-28 08:16:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:15,168 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-28 08:16:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-28 08:16:15,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:15,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:15,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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 595 states. [2022-04-28 08:16:15,172 INFO L87 Difference]: Start difference. First operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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 595 states. [2022-04-28 08:16:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:15,193 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-28 08:16:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-28 08:16:15,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:15,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:15,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:15,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 589 states have (on average 1.7181663837011885) internal successors, (1012), 589 states have internal predecessors, (1012), 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-28 08:16:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1015 transitions. [2022-04-28 08:16:15,223 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1015 transitions. Word has length 26 [2022-04-28 08:16:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:15,224 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 1015 transitions. [2022-04-28 08:16:15,224 INFO L496 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-28 08:16:15,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 593 states and 1015 transitions. [2022-04-28 08:16:16,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1015 transitions. [2022-04-28 08:16:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:16,202 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:16,202 INFO L195 NwaCegarLoop]: 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-28 08:16:16,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:16:16,202 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 1 times [2022-04-28 08:16:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127814330] [2022-04-28 08:16:16,203 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 2 times [2022-04-28 08:16:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540258124] [2022-04-28 08:16:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {17678#(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); {17672#true} is VALID [2022-04-28 08:16:16,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-28 08:16:16,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-28 08:16:16,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {17672#true} call ULTIMATE.init(); {17678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:16,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {17678#(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); {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {17672#true} call #t~ret17 := main(); {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {17672#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {17672#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {17672#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;~lk12~0 := 0; {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {17672#true} assume !(0 != ~p1~0); {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {17672#true} assume !(0 != ~p2~0); {17672#true} is VALID [2022-04-28 08:16:16,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {17672#true} assume !(0 != ~p3~0); {17672#true} is VALID [2022-04-28 08:16:16,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {17672#true} assume 0 != ~p4~0;~lk4~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {17677#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {17677#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:16,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {17673#false} is VALID [2022-04-28 08:16:16,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {17673#false} assume 0 != ~p5~0; {17673#false} is VALID [2022-04-28 08:16:16,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {17673#false} assume 1 != ~lk5~0; {17673#false} is VALID [2022-04-28 08:16:16,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {17673#false} assume !false; {17673#false} is VALID [2022-04-28 08:16:16,256 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-28 08:16:16,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:16,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540258124] [2022-04-28 08:16:16,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540258124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:16,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127814330] [2022-04-28 08:16:16,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127814330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832888407] [2022-04-28 08:16:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:16,258 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-28 08:16:16,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:16,258 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-28 08:16:16,279 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-28 08:16:16,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:16,280 INFO L87 Difference]: Start difference. First operand 593 states and 1015 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-28 08:16:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,587 INFO L93 Difference]: Finished difference Result 889 states and 1517 transitions. [2022-04-28 08:16:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:16,587 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-28 08:16:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:16,587 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-28 08:16:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-28 08:16:16,589 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-28 08:16:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-28 08:16:16,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions. [2022-04-28 08:16:16,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,777 INFO L225 Difference]: With dead ends: 889 [2022-04-28 08:16:16,778 INFO L226 Difference]: Without dead ends: 603 [2022-04-28 08:16:16,778 INFO L412 NwaCegarLoop]: 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-28 08:16:16,779 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:16,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 124 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-28 08:16:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-28 08:16:16,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:16,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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-28 08:16:16,826 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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-28 08:16:16,827 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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-28 08:16:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,847 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-28 08:16:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-28 08:16:16,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:16,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:16,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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 603 states. [2022-04-28 08:16:16,851 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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 603 states. [2022-04-28 08:16:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,873 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-28 08:16:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-28 08:16:16,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:16,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:16,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:16,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.695142378559464) internal successors, (1012), 597 states have internal predecessors, (1012), 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-28 08:16:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1015 transitions. [2022-04-28 08:16:16,903 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1015 transitions. Word has length 27 [2022-04-28 08:16:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:16,903 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 1015 transitions. [2022-04-28 08:16:16,903 INFO L496 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-28 08:16:16,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 1015 transitions. [2022-04-28 08:16:17,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1015 edges. 1015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1015 transitions. [2022-04-28 08:16:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:17,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:17,917 INFO L195 NwaCegarLoop]: 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-28 08:16:17,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:16:17,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 1 times [2022-04-28 08:16:17,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:17,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631455355] [2022-04-28 08:16:17,918 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 2 times [2022-04-28 08:16:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:17,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9087302] [2022-04-28 08:16:17,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:17,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:17,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {21876#(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); {21870#true} is VALID [2022-04-28 08:16:17,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-28 08:16:17,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-28 08:16:17,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {21870#true} call ULTIMATE.init(); {21876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:17,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {21876#(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); {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {21870#true} call #t~ret17 := main(); {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {21870#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {21870#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {21870#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;~lk12~0 := 0; {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {21870#true} assume !(0 != ~p1~0); {21870#true} is VALID [2022-04-28 08:16:17,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {21870#true} assume !(0 != ~p2~0); {21870#true} is VALID [2022-04-28 08:16:17,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#true} assume !(0 != ~p3~0); {21870#true} is VALID [2022-04-28 08:16:17,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {21870#true} assume !(0 != ~p4~0); {21870#true} is VALID [2022-04-28 08:16:17,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {21870#true} assume 0 != ~p5~0;~lk5~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {21875#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {21875#(= main_~lk5~0 1)} assume 0 != ~p5~0; {21875#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:17,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {21875#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {21871#false} is VALID [2022-04-28 08:16:17,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {21871#false} assume !false; {21871#false} is VALID [2022-04-28 08:16:17,960 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-28 08:16:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:17,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9087302] [2022-04-28 08:16:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9087302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:17,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:17,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631455355] [2022-04-28 08:16:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631455355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742761264] [2022-04-28 08:16:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:17,962 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-28 08:16:17,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:17,962 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-28 08:16:17,978 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-28 08:16:17,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:17,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:17,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:17,979 INFO L87 Difference]: Start difference. First operand 601 states and 1015 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-28 08:16:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,319 INFO L93 Difference]: Finished difference Result 1101 states and 1889 transitions. [2022-04-28 08:16:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:18,319 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-28 08:16:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:18,320 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-28 08:16:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:16:18,321 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-28 08:16:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 08:16:18,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 08:16:18,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:18,537 INFO L225 Difference]: With dead ends: 1101 [2022-04-28 08:16:18,537 INFO L226 Difference]: Without dead ends: 1099 [2022-04-28 08:16:18,538 INFO L412 NwaCegarLoop]: 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-28 08:16:18,539 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:18,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 86 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-28 08:16:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-28 08:16:18,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:18,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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-28 08:16:18,608 INFO L74 IsIncluded]: Start isIncluded. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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-28 08:16:18,609 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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-28 08:16:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,668 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-28 08:16:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-28 08:16:18,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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 1099 states. [2022-04-28 08:16:18,675 INFO L87 Difference]: Start difference. First operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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 1099 states. [2022-04-28 08:16:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,735 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-28 08:16:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-28 08:16:18,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:18,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 837 states have (on average 1.6583034647550776) internal successors, (1388), 837 states have internal predecessors, (1388), 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-28 08:16:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1391 transitions. [2022-04-28 08:16:18,790 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1391 transitions. Word has length 27 [2022-04-28 08:16:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:18,790 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1391 transitions. [2022-04-28 08:16:18,790 INFO L496 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-28 08:16:18,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1391 transitions. [2022-04-28 08:16:20,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1391 edges. 1391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1391 transitions. [2022-04-28 08:16:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:20,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:20,248 INFO L195 NwaCegarLoop]: 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-28 08:16:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:16:20,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 1 times [2022-04-28 08:16:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931419338] [2022-04-28 08:16:20,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 2 times [2022-04-28 08:16:20,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:20,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076920067] [2022-04-28 08:16:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {27970#(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); {27964#true} is VALID [2022-04-28 08:16:20,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-28 08:16:20,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-28 08:16:20,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {27964#true} call ULTIMATE.init(); {27970#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:20,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {27970#(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); {27964#true} is VALID [2022-04-28 08:16:20,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {27964#true} call #t~ret17 := main(); {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {27964#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {27964#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {27964#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;~lk12~0 := 0; {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {27964#true} assume !(0 != ~p1~0); {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {27964#true} assume !(0 != ~p2~0); {27964#true} is VALID [2022-04-28 08:16:20,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {27964#true} assume !(0 != ~p3~0); {27964#true} is VALID [2022-04-28 08:16:20,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {27964#true} assume !(0 != ~p4~0); {27964#true} is VALID [2022-04-28 08:16:20,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {27964#true} assume !(0 != ~p5~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p10~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p1~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p2~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p3~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {27969#(= main_~p5~0 0)} assume !(0 != ~p4~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:20,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p5~0; {27965#false} is VALID [2022-04-28 08:16:20,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {27965#false} assume 1 != ~lk5~0; {27965#false} is VALID [2022-04-28 08:16:20,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {27965#false} assume !false; {27965#false} is VALID [2022-04-28 08:16:20,303 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-28 08:16:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:20,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076920067] [2022-04-28 08:16:20,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076920067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:20,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931419338] [2022-04-28 08:16:20,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931419338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456426455] [2022-04-28 08:16:20,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:20,304 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-28 08:16:20,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:20,304 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-28 08:16:20,322 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-28 08:16:20,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:20,324 INFO L87 Difference]: Start difference. First operand 841 states and 1391 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-28 08:16:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,899 INFO L93 Difference]: Finished difference Result 1981 states and 3297 transitions. [2022-04-28 08:16:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:20,899 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-28 08:16:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:20,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-28 08:16:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-28 08:16:20,903 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-28 08:16:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-28 08:16:20,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2022-04-28 08:16:21,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:21,105 INFO L225 Difference]: With dead ends: 1981 [2022-04-28 08:16:21,105 INFO L226 Difference]: Without dead ends: 1163 [2022-04-28 08:16:21,106 INFO L412 NwaCegarLoop]: 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-28 08:16:21,107 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:21,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 119 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-28 08:16:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-28 08:16:21,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:21,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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-28 08:16:21,234 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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-28 08:16:21,237 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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-28 08:16:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,300 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-28 08:16:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-28 08:16:21,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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 1163 states. [2022-04-28 08:16:21,306 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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 1163 states. [2022-04-28 08:16:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,367 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-28 08:16:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-28 08:16:21,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:21,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.6490924805531546) internal successors, (1908), 1157 states have internal predecessors, (1908), 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-28 08:16:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1911 transitions. [2022-04-28 08:16:21,453 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1911 transitions. Word has length 27 [2022-04-28 08:16:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:21,453 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1911 transitions. [2022-04-28 08:16:21,454 INFO L496 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-28 08:16:21,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1911 transitions. [2022-04-28 08:16:23,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1911 transitions. [2022-04-28 08:16:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:23,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:23,272 INFO L195 NwaCegarLoop]: 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-28 08:16:23,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:16:23,273 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 1 times [2022-04-28 08:16:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [489244611] [2022-04-28 08:16:23,274 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 2 times [2022-04-28 08:16:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:23,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335494659] [2022-04-28 08:16:23,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {36592#(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); {36586#true} is VALID [2022-04-28 08:16:23,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-28 08:16:23,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-28 08:16:23,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {36586#true} call ULTIMATE.init(); {36592#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:23,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {36592#(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); {36586#true} is VALID [2022-04-28 08:16:23,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-28 08:16:23,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-28 08:16:23,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {36586#true} call #t~ret17 := main(); {36586#true} is VALID [2022-04-28 08:16:23,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {36586#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {36586#true} is VALID [2022-04-28 08:16:23,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {36586#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {36586#true} is VALID [2022-04-28 08:16:23,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {36586#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;~lk12~0 := 0; {36586#true} is VALID [2022-04-28 08:16:23,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {36586#true} assume !(0 != ~p1~0); {36586#true} is VALID [2022-04-28 08:16:23,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {36586#true} assume !(0 != ~p2~0); {36586#true} is VALID [2022-04-28 08:16:23,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {36586#true} assume !(0 != ~p3~0); {36586#true} is VALID [2022-04-28 08:16:23,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {36586#true} assume !(0 != ~p4~0); {36586#true} is VALID [2022-04-28 08:16:23,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {36586#true} assume 0 != ~p5~0;~lk5~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {36591#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {36591#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:23,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {36587#false} is VALID [2022-04-28 08:16:23,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {36587#false} assume 0 != ~p6~0; {36587#false} is VALID [2022-04-28 08:16:23,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {36587#false} assume 1 != ~lk6~0; {36587#false} is VALID [2022-04-28 08:16:23,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {36587#false} assume !false; {36587#false} is VALID [2022-04-28 08:16:23,312 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-28 08:16:23,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:23,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335494659] [2022-04-28 08:16:23,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335494659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:23,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [489244611] [2022-04-28 08:16:23,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [489244611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539315194] [2022-04-28 08:16:23,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:23,313 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-28 08:16:23,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:23,313 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-28 08:16:23,330 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-28 08:16:23,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:23,330 INFO L87 Difference]: Start difference. First operand 1161 states and 1911 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-28 08:16:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:23,781 INFO L93 Difference]: Finished difference Result 1741 states and 2857 transitions. [2022-04-28 08:16:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:23,781 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-28 08:16:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:23,781 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-28 08:16:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 08:16:23,783 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-28 08:16:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 08:16:23,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-28 08:16:23,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:23,971 INFO L225 Difference]: With dead ends: 1741 [2022-04-28 08:16:23,971 INFO L226 Difference]: Without dead ends: 1179 [2022-04-28 08:16:23,972 INFO L412 NwaCegarLoop]: 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-28 08:16:23,972 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:23,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 121 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-28 08:16:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-28 08:16:24,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:24,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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-28 08:16:24,083 INFO L74 IsIncluded]: Start isIncluded. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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-28 08:16:24,084 INFO L87 Difference]: Start difference. First operand 1179 states. Second operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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-28 08:16:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,148 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-28 08:16:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-28 08:16:24,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:24,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:24,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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 1179 states. [2022-04-28 08:16:24,154 INFO L87 Difference]: Start difference. First operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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 1179 states. [2022-04-28 08:16:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,218 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-28 08:16:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-28 08:16:24,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:24,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:24,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:24,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1173 states have (on average 1.6265984654731458) internal successors, (1908), 1173 states have internal predecessors, (1908), 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-28 08:16:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1911 transitions. [2022-04-28 08:16:24,320 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1911 transitions. Word has length 28 [2022-04-28 08:16:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:24,320 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1911 transitions. [2022-04-28 08:16:24,320 INFO L496 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-28 08:16:24,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1177 states and 1911 transitions. [2022-04-28 08:16:26,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1911 edges. 1911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1911 transitions. [2022-04-28 08:16:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:26,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:26,164 INFO L195 NwaCegarLoop]: 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-28 08:16:26,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:16:26,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 1 times [2022-04-28 08:16:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:26,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1569260399] [2022-04-28 08:16:26,165 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 2 times [2022-04-28 08:16:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:26,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615778265] [2022-04-28 08:16:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:26,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:26,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:26,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {44798#(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); {44792#true} is VALID [2022-04-28 08:16:26,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 08:16:26,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-28 08:16:26,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {44792#true} call ULTIMATE.init(); {44798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:26,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {44798#(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); {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret17 := main(); {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {44792#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {44792#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {44792#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;~lk12~0 := 0; {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} assume !(0 != ~p1~0); {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {44792#true} assume !(0 != ~p2~0); {44792#true} is VALID [2022-04-28 08:16:26,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {44792#true} assume !(0 != ~p3~0); {44792#true} is VALID [2022-04-28 08:16:26,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {44792#true} assume !(0 != ~p4~0); {44792#true} is VALID [2022-04-28 08:16:26,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {44792#true} assume !(0 != ~p5~0); {44792#true} is VALID [2022-04-28 08:16:26,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {44792#true} assume 0 != ~p6~0;~lk6~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {44797#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {44797#(= main_~lk6~0 1)} assume 0 != ~p6~0; {44797#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:26,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {44797#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {44793#false} is VALID [2022-04-28 08:16:26,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#false} assume !false; {44793#false} is VALID [2022-04-28 08:16:26,208 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-28 08:16:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:26,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615778265] [2022-04-28 08:16:26,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615778265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:26,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:26,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:26,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:26,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1569260399] [2022-04-28 08:16:26,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1569260399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:26,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:26,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:26,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114772456] [2022-04-28 08:16:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:26,210 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-28 08:16:26,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:26,210 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-28 08:16:26,228 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-28 08:16:26,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:26,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:26,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:26,229 INFO L87 Difference]: Start difference. First operand 1177 states and 1911 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-28 08:16:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:26,742 INFO L93 Difference]: Finished difference Result 2125 states and 3513 transitions. [2022-04-28 08:16:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:26,742 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-28 08:16:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:26,742 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-28 08:16:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 08:16:26,743 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-28 08:16:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 08:16:26,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-28 08:16:26,836 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-28 08:16:27,010 INFO L225 Difference]: With dead ends: 2125 [2022-04-28 08:16:27,011 INFO L226 Difference]: Without dead ends: 2123 [2022-04-28 08:16:27,011 INFO L412 NwaCegarLoop]: 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-28 08:16:27,012 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:27,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-28 08:16:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-28 08:16:27,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:27,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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-28 08:16:27,165 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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-28 08:16:27,167 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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-28 08:16:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:27,362 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-28 08:16:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-28 08:16:27,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:27,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:27,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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-28 08:16:27,370 INFO L87 Difference]: Start difference. First operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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-28 08:16:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:27,561 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-28 08:16:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-28 08:16:27,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:27,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:27,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:27,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.5841821449970042) internal successors, (2644), 1669 states have internal predecessors, (2644), 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-28 08:16:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2647 transitions. [2022-04-28 08:16:27,793 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2647 transitions. Word has length 28 [2022-04-28 08:16:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:27,793 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 2647 transitions. [2022-04-28 08:16:27,793 INFO L496 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-28 08:16:27,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1673 states and 2647 transitions. [2022-04-28 08:16:30,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2647 edges. 2647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2647 transitions. [2022-04-28 08:16:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:30,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:30,343 INFO L195 NwaCegarLoop]: 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-28 08:16:30,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:16:30,343 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:30,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 1 times [2022-04-28 08:16:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905025263] [2022-04-28 08:16:30,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 2 times [2022-04-28 08:16:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764320107] [2022-04-28 08:16:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:30,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {56652#(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); {56646#true} is VALID [2022-04-28 08:16:30,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-28 08:16:30,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-28 08:16:30,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {56646#true} call ULTIMATE.init(); {56652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:30,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {56652#(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); {56646#true} is VALID [2022-04-28 08:16:30,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-28 08:16:30,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {56646#true} call #t~ret17 := main(); {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {56646#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {56646#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {56646#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;~lk12~0 := 0; {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {56646#true} assume !(0 != ~p1~0); {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {56646#true} assume !(0 != ~p2~0); {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {56646#true} assume !(0 != ~p3~0); {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {56646#true} assume !(0 != ~p4~0); {56646#true} is VALID [2022-04-28 08:16:30,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {56646#true} assume !(0 != ~p5~0); {56646#true} is VALID [2022-04-28 08:16:30,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {56646#true} assume !(0 != ~p6~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p10~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p1~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p2~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p3~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p4~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {56651#(= main_~p6~0 0)} assume !(0 != ~p5~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:30,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p6~0; {56647#false} is VALID [2022-04-28 08:16:30,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {56647#false} assume 1 != ~lk6~0; {56647#false} is VALID [2022-04-28 08:16:30,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {56647#false} assume !false; {56647#false} is VALID [2022-04-28 08:16:30,385 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-28 08:16:30,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:30,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764320107] [2022-04-28 08:16:30,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764320107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:30,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:30,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:30,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905025263] [2022-04-28 08:16:30,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905025263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:30,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:30,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:30,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257661097] [2022-04-28 08:16:30,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:30,386 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-28 08:16:30,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:30,387 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-28 08:16:30,405 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-28 08:16:30,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:30,405 INFO L87 Difference]: Start difference. First operand 1673 states and 2647 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-28 08:16:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:31,460 INFO L93 Difference]: Finished difference Result 3917 states and 6233 transitions. [2022-04-28 08:16:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:31,460 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-28 08:16:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:31,460 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-28 08:16:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-28 08:16:31,462 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-28 08:16:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-28 08:16:31,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-04-28 08:16:31,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:31,786 INFO L225 Difference]: With dead ends: 3917 [2022-04-28 08:16:31,786 INFO L226 Difference]: Without dead ends: 2283 [2022-04-28 08:16:31,788 INFO L412 NwaCegarLoop]: 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-28 08:16:31,789 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:31,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-28 08:16:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-28 08:16:32,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:32,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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-28 08:16:32,008 INFO L74 IsIncluded]: Start isIncluded. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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-28 08:16:32,010 INFO L87 Difference]: Start difference. First operand 2283 states. Second operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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-28 08:16:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:32,293 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-28 08:16:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-28 08:16:32,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:32,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:32,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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 2283 states. [2022-04-28 08:16:32,303 INFO L87 Difference]: Start difference. First operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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 2283 states. [2022-04-28 08:16:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:32,531 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-28 08:16:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-28 08:16:32,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:32,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:32,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:32,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 1.5757575757575757) internal successors, (3588), 2277 states have internal predecessors, (3588), 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-28 08:16:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3591 transitions. [2022-04-28 08:16:32,952 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3591 transitions. Word has length 28 [2022-04-28 08:16:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:32,952 INFO L495 AbstractCegarLoop]: Abstraction has 2281 states and 3591 transitions. [2022-04-28 08:16:32,952 INFO L496 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-28 08:16:32,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2281 states and 3591 transitions. [2022-04-28 08:16:36,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3591 transitions. [2022-04-28 08:16:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:36,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:36,586 INFO L195 NwaCegarLoop]: 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-28 08:16:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:16:36,586 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 1 times [2022-04-28 08:16:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682775265] [2022-04-28 08:16:36,587 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 2 times [2022-04-28 08:16:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672233417] [2022-04-28 08:16:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:36,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {73626#(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); {73620#true} is VALID [2022-04-28 08:16:36,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-28 08:16:36,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-28 08:16:36,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {73620#true} call ULTIMATE.init(); {73626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:36,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {73626#(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); {73620#true} is VALID [2022-04-28 08:16:36,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {73620#true} call #t~ret17 := main(); {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {73620#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {73620#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {73620#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;~lk12~0 := 0; {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {73620#true} assume !(0 != ~p1~0); {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {73620#true} assume !(0 != ~p2~0); {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {73620#true} assume !(0 != ~p3~0); {73620#true} is VALID [2022-04-28 08:16:36,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {73620#true} assume !(0 != ~p4~0); {73620#true} is VALID [2022-04-28 08:16:36,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {73620#true} assume !(0 != ~p5~0); {73620#true} is VALID [2022-04-28 08:16:36,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {73620#true} assume 0 != ~p6~0;~lk6~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {73625#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {73625#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:36,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {73621#false} is VALID [2022-04-28 08:16:36,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {73621#false} assume 0 != ~p7~0; {73621#false} is VALID [2022-04-28 08:16:36,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {73621#false} assume 1 != ~lk7~0; {73621#false} is VALID [2022-04-28 08:16:36,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {73621#false} assume !false; {73621#false} is VALID [2022-04-28 08:16:36,637 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-28 08:16:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:36,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672233417] [2022-04-28 08:16:36,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672233417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:36,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:36,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:36,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:36,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682775265] [2022-04-28 08:16:36,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682775265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:36,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:36,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425732708] [2022-04-28 08:16:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:36,639 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-28 08:16:36,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:36,639 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-28 08:16:36,655 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-28 08:16:36,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:36,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:36,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:36,656 INFO L87 Difference]: Start difference. First operand 2281 states and 3591 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-28 08:16:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:37,593 INFO L93 Difference]: Finished difference Result 3421 states and 5369 transitions. [2022-04-28 08:16:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:37,593 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-28 08:16:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:37,593 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-28 08:16:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 08:16:37,595 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-28 08:16:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 08:16:37,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-28 08:16:37,724 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-28 08:16:37,954 INFO L225 Difference]: With dead ends: 3421 [2022-04-28 08:16:37,954 INFO L226 Difference]: Without dead ends: 2315 [2022-04-28 08:16:37,956 INFO L412 NwaCegarLoop]: 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-28 08:16:37,957 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 118 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-28 08:16:37,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 118 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-28 08:16:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-28 08:16:38,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:38,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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-28 08:16:38,150 INFO L74 IsIncluded]: Start isIncluded. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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-28 08:16:38,153 INFO L87 Difference]: Start difference. First operand 2315 states. Second operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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-28 08:16:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:38,422 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-28 08:16:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-28 08:16:38,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:38,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:38,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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 2315 states. [2022-04-28 08:16:38,431 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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 2315 states. [2022-04-28 08:16:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:38,688 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-28 08:16:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-28 08:16:38,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:38,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:38,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:38,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.5539194456474665) internal successors, (3588), 2309 states have internal predecessors, (3588), 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-28 08:16:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3591 transitions. [2022-04-28 08:16:38,967 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3591 transitions. Word has length 29 [2022-04-28 08:16:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:38,967 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3591 transitions. [2022-04-28 08:16:38,968 INFO L496 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-28 08:16:38,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 3591 transitions. [2022-04-28 08:16:42,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3591 edges. 3591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3591 transitions. [2022-04-28 08:16:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:42,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:42,529 INFO L195 NwaCegarLoop]: 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-28 08:16:42,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:16:42,529 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 1 times [2022-04-28 08:16:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663286420] [2022-04-28 08:16:42,530 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 2 times [2022-04-28 08:16:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051518851] [2022-04-28 08:16:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:42,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:42,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {89736#(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); {89730#true} is VALID [2022-04-28 08:16:42,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-28 08:16:42,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-28 08:16:42,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {89730#true} call ULTIMATE.init(); {89736#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:42,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {89736#(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); {89730#true} is VALID [2022-04-28 08:16:42,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {89730#true} call #t~ret17 := main(); {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {89730#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {89730#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {89730#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;~lk12~0 := 0; {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {89730#true} assume !(0 != ~p1~0); {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {89730#true} assume !(0 != ~p2~0); {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {89730#true} assume !(0 != ~p3~0); {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {89730#true} assume !(0 != ~p4~0); {89730#true} is VALID [2022-04-28 08:16:42,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {89730#true} assume !(0 != ~p5~0); {89730#true} is VALID [2022-04-28 08:16:42,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {89730#true} assume !(0 != ~p6~0); {89730#true} is VALID [2022-04-28 08:16:42,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {89730#true} assume 0 != ~p7~0;~lk7~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {89735#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {89735#(= main_~lk7~0 1)} assume 0 != ~p7~0; {89735#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:42,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {89735#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {89731#false} is VALID [2022-04-28 08:16:42,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {89731#false} assume !false; {89731#false} is VALID [2022-04-28 08:16:42,583 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-28 08:16:42,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:42,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051518851] [2022-04-28 08:16:42,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051518851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:42,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:42,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:42,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:42,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663286420] [2022-04-28 08:16:42,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663286420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:42,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:42,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:42,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967261169] [2022-04-28 08:16:42,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:42,585 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-28 08:16:42,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:42,585 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-28 08:16:42,604 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-28 08:16:42,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:42,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:42,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:42,604 INFO L87 Difference]: Start difference. First operand 2313 states and 3591 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-28 08:16:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:43,838 INFO L93 Difference]: Finished difference Result 4109 states and 6505 transitions. [2022-04-28 08:16:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:43,838 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-28 08:16:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:43,839 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-28 08:16:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 08:16:43,840 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-28 08:16:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 08:16:43,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-28 08:16:43,955 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-28 08:16:44,659 INFO L225 Difference]: With dead ends: 4109 [2022-04-28 08:16:44,660 INFO L226 Difference]: Without dead ends: 4107 [2022-04-28 08:16:44,660 INFO L412 NwaCegarLoop]: 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-28 08:16:44,661 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:44,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 84 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-28 08:16:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-28 08:16:44,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:44,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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-28 08:16:44,956 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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-28 08:16:44,958 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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-28 08:16:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:45,508 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-28 08:16:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-28 08:16:45,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:45,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:45,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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-28 08:16:45,518 INFO L87 Difference]: Start difference. First operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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-28 08:16:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:46,033 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-28 08:16:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-28 08:16:46,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:46,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:46,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:46,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.5085508550855085) internal successors, (5028), 3333 states have internal predecessors, (5028), 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-28 08:16:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5031 transitions. [2022-04-28 08:16:46,633 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5031 transitions. Word has length 29 [2022-04-28 08:16:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:46,633 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 5031 transitions. [2022-04-28 08:16:46,633 INFO L496 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-28 08:16:46,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 5031 transitions. [2022-04-28 08:16:51,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5031 edges. 5031 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5031 transitions. [2022-04-28 08:16:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:51,694 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:51,694 INFO L195 NwaCegarLoop]: 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-28 08:16:51,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:16:51,694 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 1 times [2022-04-28 08:16:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110997845] [2022-04-28 08:16:51,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 2 times [2022-04-28 08:16:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:51,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854771445] [2022-04-28 08:16:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:51,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {112854#(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); {112848#true} is VALID [2022-04-28 08:16:51,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-28 08:16:51,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {112848#true} call ULTIMATE.init(); {112854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:51,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {112854#(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); {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {112848#true} call #t~ret17 := main(); {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {112848#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {112848#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {112848#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;~lk12~0 := 0; {112848#true} is VALID [2022-04-28 08:16:51,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {112848#true} assume !(0 != ~p1~0); {112848#true} is VALID [2022-04-28 08:16:51,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {112848#true} assume !(0 != ~p2~0); {112848#true} is VALID [2022-04-28 08:16:51,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {112848#true} assume !(0 != ~p3~0); {112848#true} is VALID [2022-04-28 08:16:51,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {112848#true} assume !(0 != ~p4~0); {112848#true} is VALID [2022-04-28 08:16:51,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {112848#true} assume !(0 != ~p5~0); {112848#true} is VALID [2022-04-28 08:16:51,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {112848#true} assume !(0 != ~p6~0); {112848#true} is VALID [2022-04-28 08:16:51,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {112848#true} assume !(0 != ~p7~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p10~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p1~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p2~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p3~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p4~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p5~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {112853#(= main_~p7~0 0)} assume !(0 != ~p6~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:51,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p7~0; {112849#false} is VALID [2022-04-28 08:16:51,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {112849#false} assume 1 != ~lk7~0; {112849#false} is VALID [2022-04-28 08:16:51,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {112849#false} assume !false; {112849#false} is VALID [2022-04-28 08:16:51,738 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-28 08:16:51,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:51,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854771445] [2022-04-28 08:16:51,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854771445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:51,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:51,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:51,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:51,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110997845] [2022-04-28 08:16:51,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110997845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:51,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:51,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164925812] [2022-04-28 08:16:51,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:51,740 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-28 08:16:51,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:51,740 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-28 08:16:51,757 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-28 08:16:51,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:51,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:51,757 INFO L87 Difference]: Start difference. First operand 3337 states and 5031 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-28 08:16:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:55,053 INFO L93 Difference]: Finished difference Result 7757 states and 11753 transitions. [2022-04-28 08:16:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:55,053 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-28 08:16:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:55,053 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-28 08:16:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 08:16:55,054 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-28 08:16:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 08:16:55,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-28 08:16:55,185 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-28 08:16:55,961 INFO L225 Difference]: With dead ends: 7757 [2022-04-28 08:16:55,961 INFO L226 Difference]: Without dead ends: 4491 [2022-04-28 08:16:55,966 INFO L412 NwaCegarLoop]: 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-28 08:16:55,967 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 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-28 08:16:55,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-28 08:16:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-28 08:16:56,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:56,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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-28 08:16:56,318 INFO L74 IsIncluded]: Start isIncluded. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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-28 08:16:56,320 INFO L87 Difference]: Start difference. First operand 4491 states. Second operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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-28 08:16:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:56,928 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-28 08:16:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-28 08:16:56,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:56,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:56,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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 4491 states. [2022-04-28 08:16:56,939 INFO L87 Difference]: Start difference. First operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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 4491 states. [2022-04-28 08:16:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:57,539 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-28 08:16:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-28 08:16:57,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:57,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:57,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:57,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4485 states have (on average 1.4992196209587514) internal successors, (6724), 4485 states have internal predecessors, (6724), 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-28 08:16:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6727 transitions. [2022-04-28 08:16:58,520 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6727 transitions. Word has length 29 [2022-04-28 08:16:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:58,520 INFO L495 AbstractCegarLoop]: Abstraction has 4489 states and 6727 transitions. [2022-04-28 08:16:58,520 INFO L496 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-28 08:16:58,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4489 states and 6727 transitions. [2022-04-28 08:17:05,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6727 transitions. [2022-04-28 08:17:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:17:05,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:05,564 INFO L195 NwaCegarLoop]: 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-28 08:17:05,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:17:05,564 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 1 times [2022-04-28 08:17:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:05,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1383136844] [2022-04-28 08:17:05,565 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 2 times [2022-04-28 08:17:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:05,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612438277] [2022-04-28 08:17:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:05,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {146340#(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); {146334#true} is VALID [2022-04-28 08:17:05,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 08:17:05,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-28 08:17:05,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:05,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {146340#(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); {146334#true} is VALID [2022-04-28 08:17:05,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 08:17:05,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-28 08:17:05,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-28 08:17:05,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {146334#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {146334#true} is VALID [2022-04-28 08:17:05,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {146334#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {146334#true} is VALID [2022-04-28 08:17:05,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {146334#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;~lk12~0 := 0; {146334#true} is VALID [2022-04-28 08:17:05,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {146334#true} assume !(0 != ~p1~0); {146334#true} is VALID [2022-04-28 08:17:05,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {146334#true} assume !(0 != ~p2~0); {146334#true} is VALID [2022-04-28 08:17:05,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {146334#true} assume !(0 != ~p3~0); {146334#true} is VALID [2022-04-28 08:17:05,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {146334#true} assume !(0 != ~p4~0); {146334#true} is VALID [2022-04-28 08:17:05,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {146334#true} assume !(0 != ~p5~0); {146334#true} is VALID [2022-04-28 08:17:05,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {146334#true} assume !(0 != ~p6~0); {146334#true} is VALID [2022-04-28 08:17:05,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {146334#true} assume 0 != ~p7~0;~lk7~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {146339#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {146339#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:17:05,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {146335#false} is VALID [2022-04-28 08:17:05,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {146335#false} assume 0 != ~p8~0; {146335#false} is VALID [2022-04-28 08:17:05,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {146335#false} assume 1 != ~lk8~0; {146335#false} is VALID [2022-04-28 08:17:05,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-28 08:17:05,604 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-28 08:17:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:05,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612438277] [2022-04-28 08:17:05,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612438277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:05,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:05,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:05,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1383136844] [2022-04-28 08:17:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1383136844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:05,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:05,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234040924] [2022-04-28 08:17:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:05,606 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-28 08:17:05,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:05,607 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-28 08:17:05,625 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-28 08:17:05,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:05,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:05,626 INFO L87 Difference]: Start difference. First operand 4489 states and 6727 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-28 08:17:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:08,284 INFO L93 Difference]: Finished difference Result 6733 states and 10057 transitions. [2022-04-28 08:17:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:08,284 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-28 08:17:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:08,284 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-28 08:17:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 08:17:08,285 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-28 08:17:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 08:17:08,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-28 08:17:08,430 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-28 08:17:09,274 INFO L225 Difference]: With dead ends: 6733 [2022-04-28 08:17:09,274 INFO L226 Difference]: Without dead ends: 4555 [2022-04-28 08:17:09,277 INFO L412 NwaCegarLoop]: 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-28 08:17:09,278 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 115 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-28 08:17:09,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 115 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-28 08:17:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-28 08:17:09,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:09,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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-28 08:17:09,599 INFO L74 IsIncluded]: Start isIncluded. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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-28 08:17:09,602 INFO L87 Difference]: Start difference. First operand 4555 states. Second operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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-28 08:17:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:10,231 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-28 08:17:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-28 08:17:10,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:10,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:10,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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 4555 states. [2022-04-28 08:17:10,245 INFO L87 Difference]: Start difference. First operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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 4555 states. [2022-04-28 08:17:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:10,871 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-28 08:17:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-28 08:17:10,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:10,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:10,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:10,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4553 states, 4549 states have (on average 1.478127060892504) internal successors, (6724), 4549 states have internal predecessors, (6724), 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-28 08:17:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6727 transitions. [2022-04-28 08:17:11,847 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6727 transitions. Word has length 30 [2022-04-28 08:17:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:11,848 INFO L495 AbstractCegarLoop]: Abstraction has 4553 states and 6727 transitions. [2022-04-28 08:17:11,848 INFO L496 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-28 08:17:11,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4553 states and 6727 transitions. [2022-04-28 08:17:18,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6727 edges. 6727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6727 transitions. [2022-04-28 08:17:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:17:18,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:18,929 INFO L195 NwaCegarLoop]: 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-28 08:17:18,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:17:18,929 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 1 times [2022-04-28 08:17:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:18,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578136986] [2022-04-28 08:17:18,930 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 2 times [2022-04-28 08:17:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:18,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244845143] [2022-04-28 08:17:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:18,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {178034#(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); {178028#true} is VALID [2022-04-28 08:17:18,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-28 08:17:18,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-28 08:17:18,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {178028#true} call ULTIMATE.init(); {178034#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:18,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {178034#(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); {178028#true} is VALID [2022-04-28 08:17:18,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-28 08:17:18,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-28 08:17:18,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {178028#true} call #t~ret17 := main(); {178028#true} is VALID [2022-04-28 08:17:18,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {178028#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {178028#true} is VALID [2022-04-28 08:17:18,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {178028#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {178028#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;~lk12~0 := 0; {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {178028#true} assume !(0 != ~p1~0); {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {178028#true} assume !(0 != ~p2~0); {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {178028#true} assume !(0 != ~p3~0); {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {178028#true} assume !(0 != ~p4~0); {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {178028#true} assume !(0 != ~p5~0); {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {178028#true} assume !(0 != ~p6~0); {178028#true} is VALID [2022-04-28 08:17:18,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {178028#true} assume !(0 != ~p7~0); {178028#true} is VALID [2022-04-28 08:17:18,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {178028#true} assume 0 != ~p8~0;~lk8~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {178033#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {178033#(= main_~lk8~0 1)} assume 0 != ~p8~0; {178033#(= main_~lk8~0 1)} is VALID [2022-04-28 08:17:18,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {178033#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {178029#false} is VALID [2022-04-28 08:17:18,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {178029#false} assume !false; {178029#false} is VALID [2022-04-28 08:17:18,975 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-28 08:17:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244845143] [2022-04-28 08:17:18,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244845143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:18,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:18,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:18,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578136986] [2022-04-28 08:17:18,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578136986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:18,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:18,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307682060] [2022-04-28 08:17:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:18,976 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-28 08:17:18,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:18,976 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-28 08:17:18,994 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-28 08:17:18,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:18,995 INFO L87 Difference]: Start difference. First operand 4553 states and 6727 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-28 08:17:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:22,632 INFO L93 Difference]: Finished difference Result 7949 states and 11977 transitions. [2022-04-28 08:17:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:22,632 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-28 08:17:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:22,632 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-28 08:17:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:17:22,633 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-28 08:17:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:17:22,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 08:17:22,717 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-28 08:17:25,241 INFO L225 Difference]: With dead ends: 7949 [2022-04-28 08:17:25,242 INFO L226 Difference]: Without dead ends: 7947 [2022-04-28 08:17:25,243 INFO L412 NwaCegarLoop]: 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-28 08:17:25,243 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:25,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-28 08:17:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-28 08:17:25,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:25,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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-28 08:17:25,769 INFO L74 IsIncluded]: Start isIncluded. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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-28 08:17:25,773 INFO L87 Difference]: Start difference. First operand 7947 states. Second operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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-28 08:17:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:27,714 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-28 08:17:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-28 08:17:27,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:27,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:27,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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 7947 states. [2022-04-28 08:17:27,729 INFO L87 Difference]: Start difference. First operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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 7947 states. [2022-04-28 08:17:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:29,673 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-28 08:17:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-28 08:17:29,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:29,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:29,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:29,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.4322173847770605) internal successors, (9540), 6661 states have internal predecessors, (9540), 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-28 08:17:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9543 transitions. [2022-04-28 08:17:31,903 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9543 transitions. Word has length 30 [2022-04-28 08:17:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:31,904 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 9543 transitions. [2022-04-28 08:17:31,904 INFO L496 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-28 08:17:31,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 9543 transitions. [2022-04-28 08:17:41,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9543 edges. 9543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9543 transitions. [2022-04-28 08:17:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:17:41,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:41,993 INFO L195 NwaCegarLoop]: 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-28 08:17:41,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:17:41,994 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 1 times [2022-04-28 08:17:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:41,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371129673] [2022-04-28 08:17:41,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 2 times [2022-04-28 08:17:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:41,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779115003] [2022-04-28 08:17:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:41,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:42,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {223168#(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); {223162#true} is VALID [2022-04-28 08:17:42,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-28 08:17:42,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-28 08:17:42,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {223162#true} call ULTIMATE.init(); {223168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {223168#(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); {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {223162#true} call #t~ret17 := main(); {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {223162#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {223162#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {223162#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;~lk12~0 := 0; {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {223162#true} assume !(0 != ~p1~0); {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {223162#true} assume !(0 != ~p2~0); {223162#true} is VALID [2022-04-28 08:17:42,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {223162#true} assume !(0 != ~p3~0); {223162#true} is VALID [2022-04-28 08:17:42,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {223162#true} assume !(0 != ~p4~0); {223162#true} is VALID [2022-04-28 08:17:42,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {223162#true} assume !(0 != ~p5~0); {223162#true} is VALID [2022-04-28 08:17:42,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {223162#true} assume !(0 != ~p6~0); {223162#true} is VALID [2022-04-28 08:17:42,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {223162#true} assume !(0 != ~p7~0); {223162#true} is VALID [2022-04-28 08:17:42,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {223162#true} assume !(0 != ~p8~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p10~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p1~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p2~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p3~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p4~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p5~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p6~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {223167#(= main_~p8~0 0)} assume !(0 != ~p7~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:42,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p8~0; {223163#false} is VALID [2022-04-28 08:17:42,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {223163#false} assume 1 != ~lk8~0; {223163#false} is VALID [2022-04-28 08:17:42,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {223163#false} assume !false; {223163#false} is VALID [2022-04-28 08:17:42,035 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-28 08:17:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:42,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779115003] [2022-04-28 08:17:42,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779115003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:42,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:42,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:42,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:42,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371129673] [2022-04-28 08:17:42,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371129673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:42,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:42,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381571012] [2022-04-28 08:17:42,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:42,036 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-28 08:17:42,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:42,037 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-28 08:17:42,054 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-28 08:17:42,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:42,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:42,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:42,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:42,055 INFO L87 Difference]: Start difference. First operand 6665 states and 9543 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-28 08:17:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:54,817 INFO L93 Difference]: Finished difference Result 15373 states and 22089 transitions. [2022-04-28 08:17:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:54,817 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-28 08:17:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:54,818 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-28 08:17:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-28 08:17:54,819 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-28 08:17:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-28 08:17:54,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-04-28 08:17:54,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:58,135 INFO L225 Difference]: With dead ends: 15373 [2022-04-28 08:17:58,136 INFO L226 Difference]: Without dead ends: 8843 [2022-04-28 08:17:58,143 INFO L412 NwaCegarLoop]: 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-28 08:17:58,143 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:58,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 125 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-28 08:17:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-28 08:17:58,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:58,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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-28 08:17:58,902 INFO L74 IsIncluded]: Start isIncluded. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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-28 08:17:58,912 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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-28 08:18:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:01,233 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-28 08:18:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-28 08:18:01,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:01,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:01,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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 8843 states. [2022-04-28 08:18:01,259 INFO L87 Difference]: Start difference. First operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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 8843 states. [2022-04-28 08:18:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:03,566 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-28 08:18:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-28 08:18:03,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:03,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:03,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:03,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 1.419938893289578) internal successors, (12548), 8837 states have internal predecessors, (12548), 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-28 08:18:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12551 transitions. [2022-04-28 08:18:07,301 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12551 transitions. Word has length 30 [2022-04-28 08:18:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:07,302 INFO L495 AbstractCegarLoop]: Abstraction has 8841 states and 12551 transitions. [2022-04-28 08:18:07,302 INFO L496 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-28 08:18:07,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8841 states and 12551 transitions. [2022-04-28 08:18:21,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12551 transitions. [2022-04-28 08:18:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:18:21,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:21,098 INFO L195 NwaCegarLoop]: 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-28 08:18:21,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:18:21,098 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 1 times [2022-04-28 08:18:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587550483] [2022-04-28 08:18:21,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 2 times [2022-04-28 08:18:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602366761] [2022-04-28 08:18:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:21,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {289294#(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); {289288#true} is VALID [2022-04-28 08:18:21,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-28 08:18:21,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-28 08:18:21,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {289288#true} call ULTIMATE.init(); {289294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:21,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {289294#(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); {289288#true} is VALID [2022-04-28 08:18:21,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-28 08:18:21,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-28 08:18:21,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {289288#true} call #t~ret17 := main(); {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {289288#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {289288#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {289288#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;~lk12~0 := 0; {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {289288#true} assume !(0 != ~p1~0); {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {289288#true} assume !(0 != ~p2~0); {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {289288#true} assume !(0 != ~p3~0); {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {289288#true} assume !(0 != ~p4~0); {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {289288#true} assume !(0 != ~p5~0); {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {289288#true} assume !(0 != ~p6~0); {289288#true} is VALID [2022-04-28 08:18:21,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {289288#true} assume !(0 != ~p7~0); {289288#true} is VALID [2022-04-28 08:18:21,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {289288#true} assume 0 != ~p8~0;~lk8~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {289293#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {289293#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:18:21,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {289289#false} is VALID [2022-04-28 08:18:21,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {289289#false} assume 0 != ~p9~0; {289289#false} is VALID [2022-04-28 08:18:21,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {289289#false} assume 1 != ~lk9~0; {289289#false} is VALID [2022-04-28 08:18:21,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {289289#false} assume !false; {289289#false} is VALID [2022-04-28 08:18:21,143 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-28 08:18:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602366761] [2022-04-28 08:18:21,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602366761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:21,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:21,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:21,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:21,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587550483] [2022-04-28 08:18:21,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587550483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:21,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:21,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168908530] [2022-04-28 08:18:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:21,144 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-28 08:18:21,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:21,144 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-28 08:18:21,162 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-28 08:18:21,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:21,163 INFO L87 Difference]: Start difference. First operand 8841 states and 12551 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-28 08:18:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:30,843 INFO L93 Difference]: Finished difference Result 13261 states and 18761 transitions. [2022-04-28 08:18:30,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:30,844 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-28 08:18:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:30,844 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-28 08:18:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-28 08:18:30,845 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-28 08:18:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-28 08:18:30,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-28 08:18:30,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:34,185 INFO L225 Difference]: With dead ends: 13261 [2022-04-28 08:18:34,186 INFO L226 Difference]: Without dead ends: 8971 [2022-04-28 08:18:34,190 INFO L412 NwaCegarLoop]: 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-28 08:18:34,191 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 112 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-28 08:18:34,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:18:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-28 08:18:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-28 08:18:34,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:34,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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-28 08:18:34,938 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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-28 08:18:34,947 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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-28 08:18:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:37,335 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-28 08:18:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-28 08:18:37,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:37,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:37,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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 8971 states. [2022-04-28 08:18:37,375 INFO L87 Difference]: Start difference. First operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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 8971 states. [2022-04-28 08:18:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:39,914 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-28 08:18:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-28 08:18:39,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:39,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:39,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:39,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8969 states, 8965 states have (on average 1.399665365309537) internal successors, (12548), 8965 states have internal predecessors, (12548), 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-28 08:18:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12551 transitions. [2022-04-28 08:18:43,709 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12551 transitions. Word has length 31 [2022-04-28 08:18:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:43,709 INFO L495 AbstractCegarLoop]: Abstraction has 8969 states and 12551 transitions. [2022-04-28 08:18:43,709 INFO L496 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-28 08:18:43,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8969 states and 12551 transitions. [2022-04-28 08:18:57,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12551 edges. 12551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12551 transitions. [2022-04-28 08:18:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:18:57,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:57,648 INFO L195 NwaCegarLoop]: 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-28 08:18:57,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:18:57,648 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:57,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 1 times [2022-04-28 08:18:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:57,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798701216] [2022-04-28 08:18:57,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:57,649 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 2 times [2022-04-28 08:18:57,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:57,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109906762] [2022-04-28 08:18:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:57,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:57,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {351708#(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); {351702#true} is VALID [2022-04-28 08:18:57,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-28 08:18:57,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-28 08:18:57,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {351702#true} call ULTIMATE.init(); {351708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:57,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {351708#(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); {351702#true} is VALID [2022-04-28 08:18:57,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-28 08:18:57,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-28 08:18:57,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {351702#true} call #t~ret17 := main(); {351702#true} is VALID [2022-04-28 08:18:57,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {351702#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {351702#true} is VALID [2022-04-28 08:18:57,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {351702#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {351702#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;~lk12~0 := 0; {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {351702#true} assume !(0 != ~p1~0); {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {351702#true} assume !(0 != ~p2~0); {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {351702#true} assume !(0 != ~p3~0); {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {351702#true} assume !(0 != ~p4~0); {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {351702#true} assume !(0 != ~p5~0); {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {351702#true} assume !(0 != ~p6~0); {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {351702#true} assume !(0 != ~p7~0); {351702#true} is VALID [2022-04-28 08:18:57,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {351702#true} assume !(0 != ~p8~0); {351702#true} is VALID [2022-04-28 08:18:57,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {351702#true} assume 0 != ~p9~0;~lk9~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {351707#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {351707#(= main_~lk9~0 1)} assume 0 != ~p9~0; {351707#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:57,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {351707#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {351703#false} is VALID [2022-04-28 08:18:57,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {351703#false} assume !false; {351703#false} is VALID [2022-04-28 08:18:57,694 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-28 08:18:57,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109906762] [2022-04-28 08:18:57,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109906762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:57,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:57,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:57,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798701216] [2022-04-28 08:18:57,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798701216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:57,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:57,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:57,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761396809] [2022-04-28 08:18:57,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:57,695 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-28 08:18:57,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:57,695 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-28 08:18:57,716 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-28 08:18:57,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:57,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:57,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:57,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:57,717 INFO L87 Difference]: Start difference. First operand 8969 states and 12551 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-28 08:19:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:10,907 INFO L93 Difference]: Finished difference Result 15373 states and 21897 transitions. [2022-04-28 08:19:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:10,907 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-28 08:19:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:10,907 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-28 08:19:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 08:19:10,908 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-28 08:19:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 08:19:10,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-28 08:19:10,993 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-28 08:19:21,052 INFO L225 Difference]: With dead ends: 15373 [2022-04-28 08:19:21,052 INFO L226 Difference]: Without dead ends: 15371 [2022-04-28 08:19:21,055 INFO L412 NwaCegarLoop]: 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-28 08:19:21,055 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 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-28 08:19:21,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-28 08:19:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-28 08:19:22,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:22,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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-28 08:19:22,128 INFO L74 IsIncluded]: Start isIncluded. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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-28 08:19:22,143 INFO L87 Difference]: Start difference. First operand 15371 states. Second operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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-28 08:19:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:29,400 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-28 08:19:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-28 08:19:29,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:29,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:29,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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 15371 states. [2022-04-28 08:19:29,444 INFO L87 Difference]: Start difference. First operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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 15371 states. [2022-04-28 08:19:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:37,256 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-28 08:19:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-28 08:19:37,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:37,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:37,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:37,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13321 states, 13317 states have (on average 1.355560561688068) internal successors, (18052), 13317 states have internal predecessors, (18052), 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-28 08:19:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 18055 transitions. [2022-04-28 08:19:46,596 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 18055 transitions. Word has length 31 [2022-04-28 08:19:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:46,596 INFO L495 AbstractCegarLoop]: Abstraction has 13321 states and 18055 transitions. [2022-04-28 08:19:46,596 INFO L496 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-28 08:19:46,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13321 states and 18055 transitions. [2022-04-28 08:20:06,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18055 edges. 18055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 18055 transitions. [2022-04-28 08:20:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:20:06,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:06,514 INFO L195 NwaCegarLoop]: 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-28 08:20:06,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:20:06,514 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 1 times [2022-04-28 08:20:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:06,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663121213] [2022-04-28 08:20:06,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 2 times [2022-04-28 08:20:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:06,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455262381] [2022-04-28 08:20:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:06,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:06,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {439850#(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); {439844#true} is VALID [2022-04-28 08:20:06,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-28 08:20:06,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-28 08:20:06,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {439844#true} call ULTIMATE.init(); {439850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:06,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {439850#(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); {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {439844#true} call #t~ret17 := main(); {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {439844#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {439844#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {439844#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;~lk12~0 := 0; {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {439844#true} assume !(0 != ~p1~0); {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {439844#true} assume !(0 != ~p2~0); {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {439844#true} assume !(0 != ~p3~0); {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {439844#true} assume !(0 != ~p4~0); {439844#true} is VALID [2022-04-28 08:20:06,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {439844#true} assume !(0 != ~p5~0); {439844#true} is VALID [2022-04-28 08:20:06,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {439844#true} assume !(0 != ~p6~0); {439844#true} is VALID [2022-04-28 08:20:06,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {439844#true} assume !(0 != ~p7~0); {439844#true} is VALID [2022-04-28 08:20:06,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {439844#true} assume !(0 != ~p8~0); {439844#true} is VALID [2022-04-28 08:20:06,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {439844#true} assume !(0 != ~p9~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p10~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p1~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p2~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p3~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p4~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p5~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p6~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p7~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {439849#(= main_~p9~0 0)} assume !(0 != ~p8~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 08:20:06,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p9~0; {439845#false} is VALID [2022-04-28 08:20:06,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {439845#false} assume 1 != ~lk9~0; {439845#false} is VALID [2022-04-28 08:20:06,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {439845#false} assume !false; {439845#false} is VALID [2022-04-28 08:20:06,561 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-28 08:20:06,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:06,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455262381] [2022-04-28 08:20:06,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455262381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:06,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:06,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:06,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:06,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663121213] [2022-04-28 08:20:06,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663121213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:06,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:06,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147279027] [2022-04-28 08:20:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:06,562 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-28 08:20:06,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:06,563 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-28 08:20:06,580 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-28 08:20:06,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:06,581 INFO L87 Difference]: Start difference. First operand 13321 states and 18055 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-28 08:21:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:34,603 INFO L93 Difference]: Finished difference Result 30477 states and 41353 transitions. [2022-04-28 08:21:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:34,603 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-28 08:21:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:34,603 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-28 08:21:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 08:21:34,604 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-28 08:21:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 08:21:34,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-28 08:21:34,730 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-28 08:21:46,894 INFO L225 Difference]: With dead ends: 30477 [2022-04-28 08:21:46,894 INFO L226 Difference]: Without dead ends: 17419 [2022-04-28 08:21:46,909 INFO L412 NwaCegarLoop]: 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-28 08:21:46,909 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 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-28 08:21:46,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-28 08:21:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-28 08:21:48,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:48,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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-28 08:21:48,382 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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-28 08:21:48,405 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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-28 08:21:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:56,896 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-28 08:21:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-28 08:21:56,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:56,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:56,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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 17419 states. [2022-04-28 08:21:56,953 INFO L87 Difference]: Start difference. First operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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 17419 states. [2022-04-28 08:22:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:22:05,921 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-28 08:22:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-28 08:22:05,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:22:05,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:22:05,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:22:05,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:22:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17417 states, 17413 states have (on average 1.3380807442715212) internal successors, (23300), 17413 states have internal predecessors, (23300), 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-28 08:22:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 23303 transitions. [2022-04-28 08:22:21,519 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 23303 transitions. Word has length 31 [2022-04-28 08:22:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:22:21,519 INFO L495 AbstractCegarLoop]: Abstraction has 17417 states and 23303 transitions. [2022-04-28 08:22:21,519 INFO L496 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-28 08:22:21,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17417 states and 23303 transitions. [2022-04-28 08:22:48,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 23303 transitions. [2022-04-28 08:22:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:22:48,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:22:48,090 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 08:22:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:22:48,090 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:22:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:22:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 1 times [2022-04-28 08:22:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [268849068] [2022-04-28 08:22:48,091 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:22:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 2 times [2022-04-28 08:22:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:22:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345753584] [2022-04-28 08:22:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:22:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:22:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:22:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:22:48,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {570488#(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); {570482#true} is VALID [2022-04-28 08:22:48,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-28 08:22:48,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-28 08:22:48,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {570482#true} call ULTIMATE.init(); {570488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {570488#(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); {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {570482#true} call #t~ret17 := main(); {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {570482#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {570482#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {570482#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;~lk12~0 := 0; {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {570482#true} assume !(0 != ~p1~0); {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {570482#true} assume !(0 != ~p2~0); {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {570482#true} assume !(0 != ~p3~0); {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {570482#true} assume !(0 != ~p4~0); {570482#true} is VALID [2022-04-28 08:22:48,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {570482#true} assume !(0 != ~p5~0); {570482#true} is VALID [2022-04-28 08:22:48,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {570482#true} assume !(0 != ~p6~0); {570482#true} is VALID [2022-04-28 08:22:48,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {570482#true} assume !(0 != ~p7~0); {570482#true} is VALID [2022-04-28 08:22:48,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {570482#true} assume !(0 != ~p8~0); {570482#true} is VALID [2022-04-28 08:22:48,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {570482#true} assume 0 != ~p9~0;~lk9~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {570487#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {570487#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:22:48,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {570483#false} is VALID [2022-04-28 08:22:48,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {570483#false} assume 0 != ~p10~0; {570483#false} is VALID [2022-04-28 08:22:48,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {570483#false} assume 1 != ~lk10~0; {570483#false} is VALID [2022-04-28 08:22:48,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {570483#false} assume !false; {570483#false} is VALID [2022-04-28 08:22:48,140 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-28 08:22:48,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:22:48,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345753584] [2022-04-28 08:22:48,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345753584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:48,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:48,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:48,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:48,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [268849068] [2022-04-28 08:22:48,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [268849068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:48,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:48,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756336858] [2022-04-28 08:22:48,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:48,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-28 08:22:48,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:48,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-28 08:22:48,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:48,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:48,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:48,161 INFO L87 Difference]: Start difference. First operand 17417 states and 23303 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-28 08:23:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:23:41,328 INFO L93 Difference]: Finished difference Result 26125 states and 34825 transitions. [2022-04-28 08:23:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:23:41,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-28 08:23:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:23:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-28 08:23:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 08:23:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-28 08:23:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 08:23:41,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-28 08:23:41,451 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-28 08:23:53,955 INFO L225 Difference]: With dead ends: 26125 [2022-04-28 08:23:53,956 INFO L226 Difference]: Without dead ends: 17675 [2022-04-28 08:23:53,967 INFO L412 NwaCegarLoop]: 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-28 08:23:53,968 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 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-28 08:23:53,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:23:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-28 08:23:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-28 08:23:55,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:23:55,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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-28 08:23:55,500 INFO L74 IsIncluded]: Start isIncluded. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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-28 08:23:55,525 INFO L87 Difference]: Start difference. First operand 17675 states. Second operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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-28 08:24:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:05,040 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-28 08:24:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-28 08:24:05,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:05,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:05,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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 17675 states. [2022-04-28 08:24:05,102 INFO L87 Difference]: Start difference. First operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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 17675 states. [2022-04-28 08:24:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:24:14,893 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-28 08:24:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-28 08:24:14,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:24:14,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:24:14,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:24:14,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:24:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17673 states, 17669 states have (on average 1.3186937574282642) internal successors, (23300), 17669 states have internal predecessors, (23300), 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-28 08:24:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 23303 transitions. [2022-04-28 08:24:29,944 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 23303 transitions. Word has length 32 [2022-04-28 08:24:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:24:29,944 INFO L495 AbstractCegarLoop]: Abstraction has 17673 states and 23303 transitions. [2022-04-28 08:24:29,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-28 08:24:29,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17673 states and 23303 transitions. [2022-04-28 08:24:56,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23303 edges. 23303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:24:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 23303 transitions. [2022-04-28 08:24:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 08:24:56,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:24:56,329 INFO L195 NwaCegarLoop]: 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, 1] [2022-04-28 08:24:56,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:24:56,329 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:24:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:24:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 1 times [2022-04-28 08:24:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:56,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178521293] [2022-04-28 08:24:56,330 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:24:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 2 times [2022-04-28 08:24:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:24:56,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152378251] [2022-04-28 08:24:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:24:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:24:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:56,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:24:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:24:56,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {693446#(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); {693440#true} is VALID [2022-04-28 08:24:56,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-28 08:24:56,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {693440#true} call ULTIMATE.init(); {693446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:24:56,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {693446#(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); {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {693440#true} call #t~ret17 := main(); {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {693440#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;havoc ~cond~0; {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {693440#true} assume !false;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~cond~0 := #t~nondet16;havoc #t~nondet16; {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {693440#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;~lk12~0 := 0; {693440#true} is VALID [2022-04-28 08:24:56,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {693440#true} assume !(0 != ~p1~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {693440#true} assume !(0 != ~p2~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {693440#true} assume !(0 != ~p3~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {693440#true} assume !(0 != ~p4~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {693440#true} assume !(0 != ~p5~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {693440#true} assume !(0 != ~p6~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {693440#true} assume !(0 != ~p7~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {693440#true} assume !(0 != ~p8~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {693440#true} assume !(0 != ~p9~0); {693440#true} is VALID [2022-04-28 08:24:56,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {693440#true} assume !(0 != ~p10~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p1~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p2~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p3~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p4~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p5~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p6~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p7~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p8~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {693445#(= main_~p10~0 0)} assume !(0 != ~p9~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 08:24:56,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p10~0; {693441#false} is VALID [2022-04-28 08:24:56,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {693441#false} assume 1 != ~lk10~0; {693441#false} is VALID [2022-04-28 08:24:56,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {693441#false} assume !false; {693441#false} is VALID [2022-04-28 08:24:56,371 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-28 08:24:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:24:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152378251] [2022-04-28 08:24:56,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152378251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:56,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:56,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:56,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:24:56,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178521293] [2022-04-28 08:24:56,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178521293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:24:56,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:24:56,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:24:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868680622] [2022-04-28 08:24:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:24:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-04-28 08:24:56,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:24:56,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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-28 08:24:56,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:24:56,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:24:56,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:24:56,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:24:56,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:24:56,393 INFO L87 Difference]: Start difference. First operand 17673 states and 23303 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 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)