/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:58:34,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:58:34,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:58:34,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:58:34,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:58:34,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:58:34,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:58:34,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:58:34,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:58:34,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:58:34,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:58:34,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:58:34,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:58:34,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:58:34,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:58:34,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:58:34,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:58:34,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:58:34,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:58:34,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:58:34,345 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:58:34,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:58:34,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:58:34,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:58:34,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:58:34,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:58:34,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:58:34,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:58:34,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:58:34,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:58:34,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:58:34,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:58:34,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:58:34,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:58:34,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:58:34,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:58:34,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:58:34,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:58:34,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:58:34,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:58:34,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:58:34,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:58:34,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:58:34,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:58:34,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:58:34,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:58:34,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:58:34,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:58:34,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:58:34,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:58:34,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:58:34,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:58:34,369 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:58:34,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:58:34,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:58:34,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:58:34,370 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:58:34,370 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 14:58:34,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:58:34,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:58:34,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:58:34,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:58:34,575 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:58:34,576 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 14:58:34,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab640135/ddd547d9ac0f4facad776a3d37a291c0/FLAGd49f63fec [2022-04-28 14:58:34,916 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:58:34,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-04-28 14:58:34,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab640135/ddd547d9ac0f4facad776a3d37a291c0/FLAGd49f63fec [2022-04-28 14:58:35,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab640135/ddd547d9ac0f4facad776a3d37a291c0 [2022-04-28 14:58:35,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:58:35,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:58:35,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:58:35,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:58:35,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:58:35,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7189b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35, skipping insertion in model container [2022-04-28 14:58:35,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:58:35,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:58:35,559 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 14:58:35,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:58:35,571 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:58:35,601 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 14:58:35,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:58:35,621 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:58:35,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35 WrapperNode [2022-04-28 14:58:35,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:58:35,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:58:35,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:58:35,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:58:35,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:58:35,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:58:35,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:58:35,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:58:35,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (1/1) ... [2022-04-28 14:58:35,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:58:35,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:58:35,685 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 14:58:35,690 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 14:58:35,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:58:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:58:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:58:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:58:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:58:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:58:35,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:58:35,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:58:35,793 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:58:35,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:58:36,030 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:58:36,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:58:36,035 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:58:36,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:58:36 BoogieIcfgContainer [2022-04-28 14:58:36,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:58:36,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:58:36,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:58:36,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:58:36,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:58:35" (1/3) ... [2022-04-28 14:58:36,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a5871f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:58:36, skipping insertion in model container [2022-04-28 14:58:36,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:58:35" (2/3) ... [2022-04-28 14:58:36,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a5871f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:58:36, skipping insertion in model container [2022-04-28 14:58:36,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:58:36" (3/3) ... [2022-04-28 14:58:36,044 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-04-28 14:58:36,053 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:58:36,053 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:58:36,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:58:36,094 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@29026071, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39de12d1 [2022-04-28 14:58:36,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:58:36,100 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 14:58:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 14:58:36,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:36,105 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 14:58:36,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 1 times [2022-04-28 14:58:36,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:36,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217301826] [2022-04-28 14:58:36,120 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:36,120 INFO L85 PathProgramCache]: Analyzing trace with hash 88534809, now seen corresponding path program 2 times [2022-04-28 14:58:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:36,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75000465] [2022-04-28 14:58:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:36,326 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 14:58:36,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-28 14:58:36,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-28 14:58:36,328 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 14:58:36,329 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 14:58:36,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-28 14:58:36,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #234#return; {54#true} is VALID [2022-04-28 14:58:36,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret17 := main(); {54#true} is VALID [2022-04-28 14:58:36,329 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 14:58:36,329 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 14:58:36,330 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 14:58:36,330 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 14:58:36,331 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 14:58:36,331 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 14:58:36,331 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 14:58:36,332 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 14:58:36,332 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 14:58:36,333 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 14:58:36,333 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 14:58:36,334 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 14:58:36,334 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 14:58:36,335 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 14:58:36,335 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 14:58:36,335 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 14:58:36,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {55#false} is VALID [2022-04-28 14:58:36,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-28 14:58:36,336 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 14:58:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75000465] [2022-04-28 14:58:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75000465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:36,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:36,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:36,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:36,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217301826] [2022-04-28 14:58:36,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217301826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:36,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:36,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954800462] [2022-04-28 14:58:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:36,345 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 14:58:36,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:36,348 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 14:58:36,386 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 14:58:36,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:36,401 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 14:58:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:36,814 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2022-04-28 14:58:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:36,814 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 14:58:36,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:36,815 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 14:58:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 14:58:36,832 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 14:58:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-28 14:58:36,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-28 14:58:36,995 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 14:58:37,008 INFO L225 Difference]: With dead ends: 100 [2022-04-28 14:58:37,008 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 14:58:37,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 14:58:37,013 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 14:58:37,014 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 14:58:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 14:58:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-04-28 14:58:37,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:37,040 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 14:58:37,041 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 14:58:37,043 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 14:58:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:37,051 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-28 14:58:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-28 14:58:37,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:37,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:37,053 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 14:58:37,054 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 14:58:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:37,060 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2022-04-28 14:58:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 153 transitions. [2022-04-28 14:58:37,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:37,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:37,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:37,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:37,062 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 14:58:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2022-04-28 14:58:37,072 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2022-04-28 14:58:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:37,073 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2022-04-28 14:58:37,073 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 14:58:37,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 106 transitions. [2022-04-28 14:58:37,161 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 14:58:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2022-04-28 14:58:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 14:58:37,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:37,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] [2022-04-28 14:58:37,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:58:37,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 1 times [2022-04-28 14:58:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:37,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829763867] [2022-04-28 14:58:37,169 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1191328869, now seen corresponding path program 2 times [2022-04-28 14:58:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:37,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163143489] [2022-04-28 14:58:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:37,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:37,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:37,294 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 14:58:37,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 14:58:37,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-28 14:58:37,296 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 14:58:37,297 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 14:58:37,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 14:58:37,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #234#return; {554#true} is VALID [2022-04-28 14:58:37,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret17 := main(); {554#true} is VALID [2022-04-28 14:58:37,297 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 14:58:37,297 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 14:58:37,298 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 14:58:37,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 != ~p1~0); {559#(= main_~p1~0 0)} is VALID [2022-04-28 14:58:37,298 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 14:58:37,299 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 14:58:37,299 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 14:58:37,300 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 14:58:37,300 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 14:58:37,301 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 14:58:37,301 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 14:58:37,301 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 14:58:37,302 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 14:58:37,303 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 14:58:37,303 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 14:58:37,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {559#(= main_~p1~0 0)} assume 0 != ~p1~0; {555#false} is VALID [2022-04-28 14:58:37,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#false} assume 1 != ~lk1~0; {555#false} is VALID [2022-04-28 14:58:37,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-28 14:58:37,306 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 14:58:37,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:37,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163143489] [2022-04-28 14:58:37,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163143489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:37,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:37,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:37,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:37,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829763867] [2022-04-28 14:58:37,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829763867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:37,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:37,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602707834] [2022-04-28 14:58:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:37,310 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 14:58:37,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:37,310 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 14:58:37,327 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 14:58:37,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:37,328 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 14:58:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:37,546 INFO L93 Difference]: Finished difference Result 138 states and 253 transitions. [2022-04-28 14:58:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:37,546 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 14:58:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:37,547 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 14:58:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-28 14:58:37,551 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 14:58:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2022-04-28 14:58:37,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 228 transitions. [2022-04-28 14:58:37,700 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 14:58:37,704 INFO L225 Difference]: With dead ends: 138 [2022-04-28 14:58:37,704 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 14:58:37,705 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 14:58:37,707 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 14:58:37,708 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 14:58:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 14:58:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-28 14:58:37,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:37,720 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 14:58:37,720 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 14:58:37,720 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 14:58:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:37,723 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-28 14:58:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-28 14:58:37,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:37,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:37,724 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 14:58:37,724 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 14:58:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:37,726 INFO L93 Difference]: Finished difference Result 85 states and 151 transitions. [2022-04-28 14:58:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2022-04-28 14:58:37,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:37,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:37,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:37,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:37,727 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 14:58:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 150 transitions. [2022-04-28 14:58:37,730 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 150 transitions. Word has length 23 [2022-04-28 14:58:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:37,730 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 150 transitions. [2022-04-28 14:58:37,730 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 14:58:37,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 150 transitions. [2022-04-28 14:58:37,835 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 14:58:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2022-04-28 14:58:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:58:37,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:37,836 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 14:58:37,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:58:37,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 1 times [2022-04-28 14:58:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:37,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597353150] [2022-04-28 14:58:37,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1550175482, now seen corresponding path program 2 times [2022-04-28 14:58:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:37,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639384883] [2022-04-28 14:58:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:37,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:37,906 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 14:58:37,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:58:37,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-28 14:58:37,908 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 14:58:37,908 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 14:58:37,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:58:37,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #234#return; {1178#true} is VALID [2022-04-28 14:58:37,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret17 := main(); {1178#true} is VALID [2022-04-28 14:58:37,908 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 14:58:37,908 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 14:58:37,909 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 14:58:37,909 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 14:58:37,909 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 14:58:37,910 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 14:58:37,910 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 14:58:37,910 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 14:58:37,911 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 14:58:37,911 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 14:58:37,911 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 14:58:37,911 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 14:58:37,912 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 14:58:37,912 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 14:58:37,912 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 14:58:37,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1179#false} is VALID [2022-04-28 14:58:37,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#false} assume 0 != ~p2~0; {1179#false} is VALID [2022-04-28 14:58:37,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#false} assume 1 != ~lk2~0; {1179#false} is VALID [2022-04-28 14:58:37,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 14:58:37,913 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 14:58:37,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:37,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639384883] [2022-04-28 14:58:37,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639384883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:37,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:37,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:37,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:37,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597353150] [2022-04-28 14:58:37,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597353150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:37,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:37,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605847041] [2022-04-28 14:58:37,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:37,915 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 14:58:37,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:37,915 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 14:58:37,928 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 14:58:37,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:37,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:37,929 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 14:58:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:38,120 INFO L93 Difference]: Finished difference Result 127 states and 226 transitions. [2022-04-28 14:58:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:38,120 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 14:58:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:38,120 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 14:58:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-28 14:58:38,122 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 14:58:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2022-04-28 14:58:38,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 223 transitions. [2022-04-28 14:58:38,268 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 14:58:38,269 INFO L225 Difference]: With dead ends: 127 [2022-04-28 14:58:38,270 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 14:58:38,270 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 14:58:38,271 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:38,271 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.0s Time] [2022-04-28 14:58:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 14:58:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-04-28 14:58:38,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:38,278 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 14:58:38,278 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 14:58:38,279 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 14:58:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:38,281 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-28 14:58:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-28 14:58:38,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:38,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:38,281 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 14:58:38,282 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 14:58:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:38,284 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-28 14:58:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2022-04-28 14:58:38,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:38,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:38,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:38,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:38,284 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 14:58:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 152 transitions. [2022-04-28 14:58:38,286 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 152 transitions. Word has length 24 [2022-04-28 14:58:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:38,287 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 152 transitions. [2022-04-28 14:58:38,287 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 14:58:38,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 152 transitions. [2022-04-28 14:58:38,422 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 14:58:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 152 transitions. [2022-04-28 14:58:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:58:38,423 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:38,423 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 14:58:38,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:58:38,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 1 times [2022-04-28 14:58:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:38,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971889611] [2022-04-28 14:58:38,424 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1723723460, now seen corresponding path program 2 times [2022-04-28 14:58:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:38,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176882728] [2022-04-28 14:58:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:38,465 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 14:58:38,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:58:38,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-28 14:58:38,466 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 14:58:38,466 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 14:58:38,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:58:38,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #234#return; {1792#true} is VALID [2022-04-28 14:58:38,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret17 := main(); {1792#true} is VALID [2022-04-28 14:58:38,466 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 14:58:38,467 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 14:58:38,467 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 14:58:38,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 != ~p1~0); {1792#true} is VALID [2022-04-28 14:58:38,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume !(0 != ~p2~0); {1797#(= main_~p2~0 0)} is VALID [2022-04-28 14:58:38,469 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 14:58:38,469 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 14:58:38,470 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 14:58:38,470 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 14:58:38,470 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 14:58:38,471 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 14:58:38,471 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 14:58:38,471 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 14:58:38,472 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 14:58:38,472 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 14:58:38,472 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 14:58:38,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {1797#(= main_~p2~0 0)} assume 0 != ~p2~0; {1793#false} is VALID [2022-04-28 14:58:38,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} assume 1 != ~lk2~0; {1793#false} is VALID [2022-04-28 14:58:38,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-28 14:58:38,473 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 14:58:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:38,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176882728] [2022-04-28 14:58:38,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176882728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:38,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:38,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:38,474 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:38,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971889611] [2022-04-28 14:58:38,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971889611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:38,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:38,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476930416] [2022-04-28 14:58:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:38,474 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 14:58:38,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:38,475 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 14:58:38,490 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 14:58:38,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:38,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:38,492 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 14:58:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:38,657 INFO L93 Difference]: Finished difference Result 238 states and 432 transitions. [2022-04-28 14:58:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:38,657 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 14:58:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:38,657 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 14:58:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-28 14:58:38,659 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 14:58:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2022-04-28 14:58:38,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 226 transitions. [2022-04-28 14:58:38,799 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 14:58:38,801 INFO L225 Difference]: With dead ends: 238 [2022-04-28 14:58:38,801 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 14:58:38,802 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 14:58:38,802 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 197 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:38,802 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.0s Time] [2022-04-28 14:58:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 14:58:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-28 14:58:38,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:38,814 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 14:58:38,814 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 14:58:38,815 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 14:58:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:38,820 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-28 14:58:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-28 14:58:38,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:38,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:38,821 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 14:58:38,821 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 14:58:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:38,827 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2022-04-28 14:58:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 286 transitions. [2022-04-28 14:58:38,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:38,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:38,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:38,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:38,828 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 14:58:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 285 transitions. [2022-04-28 14:58:38,833 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 285 transitions. Word has length 24 [2022-04-28 14:58:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:38,833 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 285 transitions. [2022-04-28 14:58:38,834 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 14:58:38,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 285 transitions. [2022-04-28 14:58:39,070 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 14:58:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 285 transitions. [2022-04-28 14:58:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:58:39,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:39,071 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 14:58:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 14:58:39,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 1 times [2022-04-28 14:58:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:39,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038336469] [2022-04-28 14:58:39,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1291380158, now seen corresponding path program 2 times [2022-04-28 14:58:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:39,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699518969] [2022-04-28 14:58:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:39,117 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 14:58:39,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-28 14:58:39,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-28 14:58:39,118 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 14:58:39,118 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 14:58:39,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {2920#true} assume true; {2920#true} is VALID [2022-04-28 14:58:39,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2920#true} {2920#true} #234#return; {2920#true} is VALID [2022-04-28 14:58:39,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {2920#true} call #t~ret17 := main(); {2920#true} is VALID [2022-04-28 14:58:39,119 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 14:58:39,119 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 14:58:39,119 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 14:58:39,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2920#true} assume !(0 != ~p1~0); {2920#true} is VALID [2022-04-28 14:58:39,120 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 14:58:39,121 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 14:58:39,122 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 14:58:39,123 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 14:58:39,123 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 14:58:39,131 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 14:58:39,131 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 14:58:39,132 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 14:58:39,132 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 14:58:39,132 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 14:58:39,133 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 14:58:39,133 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 14:58:39,133 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 14:58:39,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {2925#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2921#false} is VALID [2022-04-28 14:58:39,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {2921#false} assume !false; {2921#false} is VALID [2022-04-28 14:58:39,134 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 14:58:39,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:39,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699518969] [2022-04-28 14:58:39,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699518969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:39,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:39,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:39,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:39,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038336469] [2022-04-28 14:58:39,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038336469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:39,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:39,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276675031] [2022-04-28 14:58:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:39,135 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 14:58:39,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:39,136 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 14:58:39,153 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 14:58:39,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:39,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:39,154 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 14:58:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:39,336 INFO L93 Difference]: Finished difference Result 207 states and 371 transitions. [2022-04-28 14:58:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:39,336 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 14:58:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:39,336 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 14:58:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 14:58:39,338 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 14:58:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2022-04-28 14:58:39,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 148 transitions. [2022-04-28 14:58:39,432 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 14:58:39,435 INFO L225 Difference]: With dead ends: 207 [2022-04-28 14:58:39,435 INFO L226 Difference]: Without dead ends: 205 [2022-04-28 14:58:39,436 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 14:58:39,436 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 14:58:39,436 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 14:58:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-28 14:58:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2022-04-28 14:58:39,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:39,446 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 14:58:39,446 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 14:58:39,447 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 14:58:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:39,451 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-28 14:58:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-28 14:58:39,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:39,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:39,452 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 14:58:39,452 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 14:58:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:39,457 INFO L93 Difference]: Finished difference Result 205 states and 368 transitions. [2022-04-28 14:58:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 368 transitions. [2022-04-28 14:58:39,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:39,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:39,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:39,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:39,458 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 14:58:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 283 transitions. [2022-04-28 14:58:39,461 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 283 transitions. Word has length 24 [2022-04-28 14:58:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:39,461 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 283 transitions. [2022-04-28 14:58:39,461 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 14:58:39,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 283 transitions. [2022-04-28 14:58:39,704 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 14:58:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 283 transitions. [2022-04-28 14:58:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:58:39,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:39,704 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 14:58:39,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 14:58:39,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 1 times [2022-04-28 14:58:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1092098431] [2022-04-28 14:58:39,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1896032784, now seen corresponding path program 2 times [2022-04-28 14:58:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:39,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487896850] [2022-04-28 14:58:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:39,741 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 14:58:39,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-28 14:58:39,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-28 14:58:39,742 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 14:58:39,742 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 14:58:39,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {4074#true} assume true; {4074#true} is VALID [2022-04-28 14:58:39,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4074#true} {4074#true} #234#return; {4074#true} is VALID [2022-04-28 14:58:39,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {4074#true} call #t~ret17 := main(); {4074#true} is VALID [2022-04-28 14:58:39,742 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 14:58:39,742 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 14:58:39,742 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 14:58:39,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {4074#true} assume !(0 != ~p1~0); {4074#true} is VALID [2022-04-28 14:58:39,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {4074#true} assume !(0 != ~p2~0); {4074#true} is VALID [2022-04-28 14:58:39,743 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 14:58:39,743 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 14:58:39,743 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 14:58:39,744 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 14:58:39,744 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 14:58:39,744 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 14:58:39,745 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 14:58:39,745 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 14:58:39,745 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 14:58:39,745 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 14:58:39,746 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 14:58:39,746 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 14:58:39,746 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 14:58:39,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {4079#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {4075#false} is VALID [2022-04-28 14:58:39,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {4075#false} assume !false; {4075#false} is VALID [2022-04-28 14:58:39,747 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 14:58:39,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:39,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487896850] [2022-04-28 14:58:39,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487896850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:39,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:39,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:39,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:39,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1092098431] [2022-04-28 14:58:39,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1092098431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:39,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:39,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788596101] [2022-04-28 14:58:39,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:39,748 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 14:58:39,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:39,749 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 14:58:39,764 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 14:58:39,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:39,765 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 14:58:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:39,925 INFO L93 Difference]: Finished difference Result 299 states and 539 transitions. [2022-04-28 14:58:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:39,925 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 14:58:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:39,925 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 14:58:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 14:58:39,927 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 14:58:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-28 14:58:39,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-28 14:58:40,020 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 14:58:40,025 INFO L225 Difference]: With dead ends: 299 [2022-04-28 14:58:40,025 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 14:58:40,025 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 14:58:40,026 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:40,026 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.0s Time] [2022-04-28 14:58:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 14:58:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 215. [2022-04-28 14:58:40,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:40,038 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 14:58:40,038 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 14:58:40,038 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 14:58:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:40,044 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-28 14:58:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-28 14:58:40,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:40,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:40,045 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 14:58:40,046 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 14:58:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:40,051 INFO L93 Difference]: Finished difference Result 297 states and 534 transitions. [2022-04-28 14:58:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 534 transitions. [2022-04-28 14:58:40,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:40,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:40,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:40,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:40,052 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 14:58:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 381 transitions. [2022-04-28 14:58:40,057 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 381 transitions. Word has length 25 [2022-04-28 14:58:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:40,057 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 381 transitions. [2022-04-28 14:58:40,057 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 14:58:40,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 381 transitions. [2022-04-28 14:58:40,366 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 14:58:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 381 transitions. [2022-04-28 14:58:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 14:58:40,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:40,367 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 14:58:40,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 14:58:40,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 1 times [2022-04-28 14:58:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:40,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520970465] [2022-04-28 14:58:40,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 616169106, now seen corresponding path program 2 times [2022-04-28 14:58:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:40,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986067842] [2022-04-28 14:58:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:40,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:40,409 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 14:58:40,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-28 14:58:40,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-28 14:58:40,410 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 14:58:40,410 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 14:58:40,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {5708#true} assume true; {5708#true} is VALID [2022-04-28 14:58:40,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5708#true} {5708#true} #234#return; {5708#true} is VALID [2022-04-28 14:58:40,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {5708#true} call #t~ret17 := main(); {5708#true} is VALID [2022-04-28 14:58:40,410 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 14:58:40,410 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 14:58:40,410 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 14:58:40,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {5708#true} assume !(0 != ~p1~0); {5708#true} is VALID [2022-04-28 14:58:40,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {5708#true} assume !(0 != ~p2~0); {5708#true} is VALID [2022-04-28 14:58:40,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {5708#true} assume !(0 != ~p3~0); {5713#(= main_~p3~0 0)} is VALID [2022-04-28 14:58:40,412 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 14:58:40,412 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 14:58:40,412 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 14:58:40,412 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 14:58:40,413 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 14:58:40,413 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 14:58:40,414 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 14:58:40,414 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 14:58:40,415 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 14:58:40,415 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 14:58:40,416 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 14:58:40,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {5713#(= main_~p3~0 0)} assume 0 != ~p3~0; {5709#false} is VALID [2022-04-28 14:58:40,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {5709#false} assume 1 != ~lk3~0; {5709#false} is VALID [2022-04-28 14:58:40,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {5709#false} assume !false; {5709#false} is VALID [2022-04-28 14:58:40,418 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 14:58:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986067842] [2022-04-28 14:58:40,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986067842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:40,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:40,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:40,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:40,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520970465] [2022-04-28 14:58:40,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520970465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:40,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:40,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:40,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803899708] [2022-04-28 14:58:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:40,419 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 14:58:40,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:40,419 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 14:58:40,435 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 14:58:40,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:40,436 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 14:58:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:40,641 INFO L93 Difference]: Finished difference Result 511 states and 915 transitions. [2022-04-28 14:58:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:40,642 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 14:58:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:40,642 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 14:58:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-28 14:58:40,643 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 14:58:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2022-04-28 14:58:40,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 222 transitions. [2022-04-28 14:58:40,769 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 14:58:40,774 INFO L225 Difference]: With dead ends: 511 [2022-04-28 14:58:40,774 INFO L226 Difference]: Without dead ends: 305 [2022-04-28 14:58:40,775 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 14:58:40,775 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 14:58:40,775 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 14:58:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-28 14:58:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2022-04-28 14:58:40,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:40,793 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 14:58:40,794 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 14:58:40,794 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 14:58:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:40,799 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-28 14:58:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-28 14:58:40,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:40,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:40,800 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 14:58:40,801 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 14:58:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:40,806 INFO L93 Difference]: Finished difference Result 305 states and 536 transitions. [2022-04-28 14:58:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 536 transitions. [2022-04-28 14:58:40,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:40,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:40,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:40,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:40,807 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 14:58:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 535 transitions. [2022-04-28 14:58:40,812 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 535 transitions. Word has length 25 [2022-04-28 14:58:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:40,812 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 535 transitions. [2022-04-28 14:58:40,812 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 14:58:40,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 535 transitions. [2022-04-28 14:58:41,257 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 14:58:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 535 transitions. [2022-04-28 14:58:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:41,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:41,258 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 14:58:41,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 14:58:41,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 1 times [2022-04-28 14:58:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:41,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457685163] [2022-04-28 14:58:41,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:41,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1352312423, now seen corresponding path program 2 times [2022-04-28 14:58:41,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:41,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690776032] [2022-04-28 14:58:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:41,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:41,298 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 14:58:41,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-28 14:58:41,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-28 14:58:41,299 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 14:58:41,299 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 14:58:41,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {7958#true} assume true; {7958#true} is VALID [2022-04-28 14:58:41,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7958#true} {7958#true} #234#return; {7958#true} is VALID [2022-04-28 14:58:41,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {7958#true} call #t~ret17 := main(); {7958#true} is VALID [2022-04-28 14:58:41,300 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 14:58:41,300 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 14:58:41,300 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 14:58:41,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {7958#true} assume !(0 != ~p1~0); {7958#true} is VALID [2022-04-28 14:58:41,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#true} assume !(0 != ~p2~0); {7958#true} is VALID [2022-04-28 14:58:41,300 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 14:58:41,301 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 14:58:41,301 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 14:58:41,301 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 14:58:41,301 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 14:58:41,302 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 14:58:41,302 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 14:58:41,302 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 14:58:41,303 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 14:58:41,303 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 14:58:41,303 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 14:58:41,304 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 14:58:41,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {7963#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7959#false} is VALID [2022-04-28 14:58:41,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {7959#false} assume 0 != ~p4~0; {7959#false} is VALID [2022-04-28 14:58:41,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {7959#false} assume 1 != ~lk4~0; {7959#false} is VALID [2022-04-28 14:58:41,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {7959#false} assume !false; {7959#false} is VALID [2022-04-28 14:58:41,305 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 14:58:41,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:41,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690776032] [2022-04-28 14:58:41,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690776032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:41,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:41,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:41,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:41,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457685163] [2022-04-28 14:58:41,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457685163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:41,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:41,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197307514] [2022-04-28 14:58:41,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:41,306 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 14:58:41,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:41,306 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 14:58:41,322 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 14:58:41,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:41,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:41,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:41,323 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 14:58:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:41,544 INFO L93 Difference]: Finished difference Result 457 states and 805 transitions. [2022-04-28 14:58:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:41,545 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 14:58:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:41,545 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 14:58:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-28 14:58:41,546 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 14:58:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2022-04-28 14:58:41,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 217 transitions. [2022-04-28 14:58:41,671 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 14:58:41,676 INFO L225 Difference]: With dead ends: 457 [2022-04-28 14:58:41,676 INFO L226 Difference]: Without dead ends: 311 [2022-04-28 14:58:41,677 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 14:58:41,677 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:41,677 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.0s Time] [2022-04-28 14:58:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-28 14:58:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-04-28 14:58:41,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:41,694 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 14:58:41,700 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 14:58:41,702 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 14:58:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:41,712 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-28 14:58:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-28 14:58:41,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:41,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:41,714 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 14:58:41,714 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 14:58:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:41,719 INFO L93 Difference]: Finished difference Result 311 states and 540 transitions. [2022-04-28 14:58:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 540 transitions. [2022-04-28 14:58:41,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:41,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:41,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:41,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:41,720 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 14:58:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 539 transitions. [2022-04-28 14:58:41,725 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 539 transitions. Word has length 26 [2022-04-28 14:58:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:41,725 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 539 transitions. [2022-04-28 14:58:41,726 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 14:58:41,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 539 transitions. [2022-04-28 14:58:42,147 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 14:58:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 539 transitions. [2022-04-28 14:58:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:42,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:42,147 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 14:58:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 14:58:42,148 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 1 times [2022-04-28 14:58:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:42,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655331167] [2022-04-28 14:58:42,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:42,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1921586519, now seen corresponding path program 2 times [2022-04-28 14:58:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:42,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532323411] [2022-04-28 14:58:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:42,194 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 14:58:42,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 14:58:42,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-28 14:58:42,195 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 14:58:42,195 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 14:58:42,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-28 14:58:42,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #234#return; {10124#true} is VALID [2022-04-28 14:58:42,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret17 := main(); {10124#true} is VALID [2022-04-28 14:58:42,196 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 14:58:42,196 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 14:58:42,196 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 14:58:42,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 != ~p1~0); {10124#true} is VALID [2022-04-28 14:58:42,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume !(0 != ~p2~0); {10124#true} is VALID [2022-04-28 14:58:42,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {10124#true} assume !(0 != ~p3~0); {10124#true} is VALID [2022-04-28 14:58:42,196 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 14:58:42,197 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 14:58:42,197 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 14:58:42,197 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 14:58:42,197 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 14:58:42,198 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 14:58:42,198 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 14:58:42,198 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 14:58:42,199 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 14:58:42,199 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 14:58:42,199 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 14:58:42,200 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 14:58:42,200 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 14:58:42,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {10129#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {10125#false} is VALID [2022-04-28 14:58:42,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-28 14:58:42,200 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 14:58:42,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:42,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532323411] [2022-04-28 14:58:42,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532323411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:42,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:42,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:42,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:42,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655331167] [2022-04-28 14:58:42,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655331167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:42,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:42,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885547283] [2022-04-28 14:58:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:42,202 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 14:58:42,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:42,202 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 14:58:42,217 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 14:58:42,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:42,218 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 14:58:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:42,436 INFO L93 Difference]: Finished difference Result 573 states and 1013 transitions. [2022-04-28 14:58:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:42,436 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 14:58:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:42,436 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 14:58:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-28 14:58:42,437 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 14:58:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2022-04-28 14:58:42,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 143 transitions. [2022-04-28 14:58:42,546 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 14:58:42,560 INFO L225 Difference]: With dead ends: 573 [2022-04-28 14:58:42,560 INFO L226 Difference]: Without dead ends: 571 [2022-04-28 14:58:42,561 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 14:58:42,562 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 14:58:42,563 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 14:58:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-04-28 14:58:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 425. [2022-04-28 14:58:42,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:42,585 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 14:58:42,586 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 14:58:42,587 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 14:58:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:42,598 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-28 14:58:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-28 14:58:42,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:42,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:42,599 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 14:58:42,600 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 14:58:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:42,611 INFO L93 Difference]: Finished difference Result 571 states and 1004 transitions. [2022-04-28 14:58:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1004 transitions. [2022-04-28 14:58:42,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:42,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:42,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:42,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:42,613 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 14:58:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 731 transitions. [2022-04-28 14:58:42,622 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 731 transitions. Word has length 26 [2022-04-28 14:58:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:42,622 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 731 transitions. [2022-04-28 14:58:42,622 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 14:58:42,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 425 states and 731 transitions. [2022-04-28 14:58:43,276 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 14:58:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 731 transitions. [2022-04-28 14:58:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:58:43,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:43,277 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 14:58:43,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 14:58:43,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:43,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:43,277 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 1 times [2022-04-28 14:58:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:43,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1438419727] [2022-04-28 14:58:43,278 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash 641722841, now seen corresponding path program 2 times [2022-04-28 14:58:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:43,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614516808] [2022-04-28 14:58:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:43,322 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 14:58:43,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-28 14:58:43,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-28 14:58:43,324 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 14:58:43,324 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 14:58:43,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {13274#true} assume true; {13274#true} is VALID [2022-04-28 14:58:43,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13274#true} {13274#true} #234#return; {13274#true} is VALID [2022-04-28 14:58:43,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {13274#true} call #t~ret17 := main(); {13274#true} is VALID [2022-04-28 14:58:43,324 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 14:58:43,324 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 14:58:43,324 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 14:58:43,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {13274#true} assume !(0 != ~p1~0); {13274#true} is VALID [2022-04-28 14:58:43,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {13274#true} assume !(0 != ~p2~0); {13274#true} is VALID [2022-04-28 14:58:43,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {13274#true} assume !(0 != ~p3~0); {13274#true} is VALID [2022-04-28 14:58:43,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {13274#true} assume !(0 != ~p4~0); {13279#(= main_~p4~0 0)} is VALID [2022-04-28 14:58:43,326 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 14:58:43,326 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 14:58:43,327 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 14:58:43,327 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 14:58:43,327 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 14:58:43,327 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 14:58:43,328 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 14:58:43,328 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 14:58:43,328 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 14:58:43,328 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 14:58:43,329 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 14:58:43,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {13279#(= main_~p4~0 0)} assume 0 != ~p4~0; {13275#false} is VALID [2022-04-28 14:58:43,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {13275#false} assume 1 != ~lk4~0; {13275#false} is VALID [2022-04-28 14:58:43,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {13275#false} assume !false; {13275#false} is VALID [2022-04-28 14:58:43,330 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 14:58:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:43,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614516808] [2022-04-28 14:58:43,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614516808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:43,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:43,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:43,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:43,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1438419727] [2022-04-28 14:58:43,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1438419727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:43,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:43,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200573373] [2022-04-28 14:58:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:43,332 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 14:58:43,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:43,332 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 14:58:43,348 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 14:58:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:43,349 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 14:58:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:43,565 INFO L93 Difference]: Finished difference Result 1005 states and 1741 transitions. [2022-04-28 14:58:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:43,565 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 14:58:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:43,565 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 14:58:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-28 14:58:43,567 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 14:58:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2022-04-28 14:58:43,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 219 transitions. [2022-04-28 14:58:43,704 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 14:58:43,718 INFO L225 Difference]: With dead ends: 1005 [2022-04-28 14:58:43,718 INFO L226 Difference]: Without dead ends: 595 [2022-04-28 14:58:43,719 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 14:58:43,720 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:43,720 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.0s Time] [2022-04-28 14:58:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-04-28 14:58:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-04-28 14:58:43,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:43,778 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 14:58:43,779 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 14:58:43,780 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 14:58:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:43,792 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-28 14:58:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-28 14:58:43,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:43,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:43,794 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 14:58:43,794 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 14:58:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:43,807 INFO L93 Difference]: Finished difference Result 595 states and 1016 transitions. [2022-04-28 14:58:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1016 transitions. [2022-04-28 14:58:43,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:43,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:43,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:43,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:43,809 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 14:58:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1015 transitions. [2022-04-28 14:58:43,829 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1015 transitions. Word has length 26 [2022-04-28 14:58:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:43,829 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 1015 transitions. [2022-04-28 14:58:43,829 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 14:58:43,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 593 states and 1015 transitions. [2022-04-28 14:58:44,705 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 14:58:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1015 transitions. [2022-04-28 14:58:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:44,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:44,706 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 14:58:44,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 14:58:44,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 1 times [2022-04-28 14:58:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:44,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219537569] [2022-04-28 14:58:44,707 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -560146297, now seen corresponding path program 2 times [2022-04-28 14:58:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:44,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23039414] [2022-04-28 14:58:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:44,759 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 14:58:44,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-28 14:58:44,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-28 14:58:44,760 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 14:58:44,760 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 14:58:44,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {17672#true} assume true; {17672#true} is VALID [2022-04-28 14:58:44,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17672#true} {17672#true} #234#return; {17672#true} is VALID [2022-04-28 14:58:44,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {17672#true} call #t~ret17 := main(); {17672#true} is VALID [2022-04-28 14:58:44,760 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 14:58:44,760 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 14:58:44,760 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 14:58:44,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {17672#true} assume !(0 != ~p1~0); {17672#true} is VALID [2022-04-28 14:58:44,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {17672#true} assume !(0 != ~p2~0); {17672#true} is VALID [2022-04-28 14:58:44,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {17672#true} assume !(0 != ~p3~0); {17672#true} is VALID [2022-04-28 14:58:44,761 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 14:58:44,761 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 14:58:44,761 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 14:58:44,762 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 14:58:44,762 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 14:58:44,762 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 14:58:44,763 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 14:58:44,763 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 14:58:44,763 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 14:58:44,764 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 14:58:44,764 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 14:58:44,765 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 14:58:44,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {17677#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {17673#false} is VALID [2022-04-28 14:58:44,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {17673#false} assume 0 != ~p5~0; {17673#false} is VALID [2022-04-28 14:58:44,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {17673#false} assume 1 != ~lk5~0; {17673#false} is VALID [2022-04-28 14:58:44,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {17673#false} assume !false; {17673#false} is VALID [2022-04-28 14:58:44,766 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 14:58:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23039414] [2022-04-28 14:58:44,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23039414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:44,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:44,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:44,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219537569] [2022-04-28 14:58:44,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219537569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:44,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:44,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:44,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834214645] [2022-04-28 14:58:44,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:44,767 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 14:58:44,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:44,767 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 14:58:44,784 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 14:58:44,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:44,785 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 14:58:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:45,016 INFO L93 Difference]: Finished difference Result 889 states and 1517 transitions. [2022-04-28 14:58:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:45,016 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 14:58:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:45,017 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 14:58:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-28 14:58:45,019 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 14:58:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2022-04-28 14:58:45,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 214 transitions. [2022-04-28 14:58:45,140 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 14:58:45,155 INFO L225 Difference]: With dead ends: 889 [2022-04-28 14:58:45,155 INFO L226 Difference]: Without dead ends: 603 [2022-04-28 14:58:45,156 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 14:58:45,157 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:45,157 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.0s Time] [2022-04-28 14:58:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-28 14:58:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-28 14:58:45,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:45,190 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 14:58:45,191 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 14:58:45,193 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 14:58:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:45,207 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-28 14:58:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-28 14:58:45,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:45,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:45,209 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 14:58:45,210 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 14:58:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:45,224 INFO L93 Difference]: Finished difference Result 603 states and 1016 transitions. [2022-04-28 14:58:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1016 transitions. [2022-04-28 14:58:45,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:45,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:45,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:45,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:45,226 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 14:58:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1015 transitions. [2022-04-28 14:58:45,244 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1015 transitions. Word has length 27 [2022-04-28 14:58:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:45,245 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 1015 transitions. [2022-04-28 14:58:45,245 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 14:58:45,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 1015 transitions. [2022-04-28 14:58:46,113 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 14:58:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1015 transitions. [2022-04-28 14:58:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:46,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:46,114 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 14:58:46,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 14:58:46,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 1 times [2022-04-28 14:58:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:46,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [892898799] [2022-04-28 14:58:46,115 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1581214651, now seen corresponding path program 2 times [2022-04-28 14:58:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:46,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218163419] [2022-04-28 14:58:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:46,160 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 14:58:46,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-28 14:58:46,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-28 14:58:46,161 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 14:58:46,161 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 14:58:46,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {21870#true} assume true; {21870#true} is VALID [2022-04-28 14:58:46,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21870#true} {21870#true} #234#return; {21870#true} is VALID [2022-04-28 14:58:46,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {21870#true} call #t~ret17 := main(); {21870#true} is VALID [2022-04-28 14:58:46,161 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 14:58:46,161 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 14:58:46,161 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 14:58:46,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {21870#true} assume !(0 != ~p1~0); {21870#true} is VALID [2022-04-28 14:58:46,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {21870#true} assume !(0 != ~p2~0); {21870#true} is VALID [2022-04-28 14:58:46,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {21870#true} assume !(0 != ~p3~0); {21870#true} is VALID [2022-04-28 14:58:46,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {21870#true} assume !(0 != ~p4~0); {21870#true} is VALID [2022-04-28 14:58:46,162 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 14:58:46,162 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 14:58:46,162 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 14:58:46,163 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 14:58:46,163 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 14:58:46,163 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 14:58:46,164 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 14:58:46,164 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 14:58:46,164 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 14:58:46,164 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 14:58:46,165 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 14:58:46,165 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 14:58:46,165 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 14:58:46,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {21875#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {21871#false} is VALID [2022-04-28 14:58:46,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {21871#false} assume !false; {21871#false} is VALID [2022-04-28 14:58:46,170 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 14:58:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:46,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218163419] [2022-04-28 14:58:46,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218163419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:46,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:46,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:46,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:46,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [892898799] [2022-04-28 14:58:46,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [892898799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:46,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:46,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:46,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753710729] [2022-04-28 14:58:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:46,172 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 14:58:46,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:46,172 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 14:58:46,186 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 14:58:46,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:46,187 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 14:58:46,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:46,422 INFO L93 Difference]: Finished difference Result 1101 states and 1889 transitions. [2022-04-28 14:58:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:46,422 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 14:58:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:46,423 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 14:58:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 14:58:46,424 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 14:58:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-28 14:58:46,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-28 14:58:46,512 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 14:58:46,559 INFO L225 Difference]: With dead ends: 1101 [2022-04-28 14:58:46,560 INFO L226 Difference]: Without dead ends: 1099 [2022-04-28 14:58:46,561 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 14:58:46,561 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 14:58:46,561 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 14:58:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-04-28 14:58:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 841. [2022-04-28 14:58:46,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:46,608 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 14:58:46,609 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 14:58:46,610 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 14:58:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:46,644 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-28 14:58:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-28 14:58:46,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:46,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:46,647 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 14:58:46,648 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 14:58:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:46,683 INFO L93 Difference]: Finished difference Result 1099 states and 1872 transitions. [2022-04-28 14:58:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1872 transitions. [2022-04-28 14:58:46,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:46,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:46,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:46,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:46,686 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 14:58:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1391 transitions. [2022-04-28 14:58:46,718 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1391 transitions. Word has length 27 [2022-04-28 14:58:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:46,718 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1391 transitions. [2022-04-28 14:58:46,719 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 14:58:46,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 841 states and 1391 transitions. [2022-04-28 14:58:47,908 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 14:58:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1391 transitions. [2022-04-28 14:58:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:58:47,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:47,909 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 14:58:47,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 14:58:47,910 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 1 times [2022-04-28 14:58:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:47,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127090699] [2022-04-28 14:58:47,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1433888967, now seen corresponding path program 2 times [2022-04-28 14:58:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:47,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678931569] [2022-04-28 14:58:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:47,958 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 14:58:47,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-28 14:58:47,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-28 14:58:47,959 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 14:58:47,959 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 14:58:47,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {27964#true} assume true; {27964#true} is VALID [2022-04-28 14:58:47,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27964#true} {27964#true} #234#return; {27964#true} is VALID [2022-04-28 14:58:47,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {27964#true} call #t~ret17 := main(); {27964#true} is VALID [2022-04-28 14:58:47,959 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 14:58:47,959 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 14:58:47,959 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 14:58:47,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {27964#true} assume !(0 != ~p1~0); {27964#true} is VALID [2022-04-28 14:58:47,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {27964#true} assume !(0 != ~p2~0); {27964#true} is VALID [2022-04-28 14:58:47,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {27964#true} assume !(0 != ~p3~0); {27964#true} is VALID [2022-04-28 14:58:47,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {27964#true} assume !(0 != ~p4~0); {27964#true} is VALID [2022-04-28 14:58:47,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {27964#true} assume !(0 != ~p5~0); {27969#(= main_~p5~0 0)} is VALID [2022-04-28 14:58:47,960 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 14:58:47,961 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 14:58:47,961 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 14:58:47,961 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 14:58:47,961 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 14:58:47,962 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 14:58:47,962 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 14:58:47,962 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 14:58:47,963 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 14:58:47,963 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 14:58:47,963 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 14:58:47,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {27969#(= main_~p5~0 0)} assume 0 != ~p5~0; {27965#false} is VALID [2022-04-28 14:58:47,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {27965#false} assume 1 != ~lk5~0; {27965#false} is VALID [2022-04-28 14:58:47,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {27965#false} assume !false; {27965#false} is VALID [2022-04-28 14:58:47,964 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 14:58:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:47,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678931569] [2022-04-28 14:58:47,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678931569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:47,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:47,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:47,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:47,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127090699] [2022-04-28 14:58:47,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127090699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:47,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:47,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806883751] [2022-04-28 14:58:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:47,965 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 14:58:47,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:47,965 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 14:58:47,979 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 14:58:47,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:47,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:47,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:47,980 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 14:58:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:48,349 INFO L93 Difference]: Finished difference Result 1981 states and 3297 transitions. [2022-04-28 14:58:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:48,349 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 14:58:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:48,349 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 14:58:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-28 14:58:48,351 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 14:58:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2022-04-28 14:58:48,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 216 transitions. [2022-04-28 14:58:48,481 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 14:58:48,535 INFO L225 Difference]: With dead ends: 1981 [2022-04-28 14:58:48,535 INFO L226 Difference]: Without dead ends: 1163 [2022-04-28 14:58:48,536 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 14:58:48,537 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:58:48,537 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.0s Time] [2022-04-28 14:58:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-28 14:58:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1161. [2022-04-28 14:58:48,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:48,603 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 14:58:48,604 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 14:58:48,605 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 14:58:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:48,639 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-28 14:58:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-28 14:58:48,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:48,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:48,642 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 14:58:48,643 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 14:58:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:48,677 INFO L93 Difference]: Finished difference Result 1163 states and 1912 transitions. [2022-04-28 14:58:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1912 transitions. [2022-04-28 14:58:48,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:48,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:48,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:48,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:48,680 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 14:58:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1911 transitions. [2022-04-28 14:58:48,736 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1911 transitions. Word has length 27 [2022-04-28 14:58:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:48,736 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1911 transitions. [2022-04-28 14:58:48,736 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 14:58:48,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1911 transitions. [2022-04-28 14:58:50,502 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 14:58:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1911 transitions. [2022-04-28 14:58:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:50,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:50,504 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 14:58:50,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 14:58:50,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 1 times [2022-04-28 14:58:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450228330] [2022-04-28 14:58:50,505 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1772799826, now seen corresponding path program 2 times [2022-04-28 14:58:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:50,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175244634] [2022-04-28 14:58:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:50,543 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 14:58:50,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-28 14:58:50,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-28 14:58:50,544 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 14:58:50,544 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 14:58:50,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {36586#true} assume true; {36586#true} is VALID [2022-04-28 14:58:50,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36586#true} {36586#true} #234#return; {36586#true} is VALID [2022-04-28 14:58:50,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {36586#true} call #t~ret17 := main(); {36586#true} is VALID [2022-04-28 14:58:50,544 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 14:58:50,544 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 14:58:50,544 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 14:58:50,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {36586#true} assume !(0 != ~p1~0); {36586#true} is VALID [2022-04-28 14:58:50,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {36586#true} assume !(0 != ~p2~0); {36586#true} is VALID [2022-04-28 14:58:50,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {36586#true} assume !(0 != ~p3~0); {36586#true} is VALID [2022-04-28 14:58:50,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {36586#true} assume !(0 != ~p4~0); {36586#true} is VALID [2022-04-28 14:58:50,545 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 14:58:50,545 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 14:58:50,545 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 14:58:50,546 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 14:58:50,546 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 14:58:50,546 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 14:58:50,546 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 14:58:50,547 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 14:58:50,547 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 14:58:50,547 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 14:58:50,547 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 14:58:50,548 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 14:58:50,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {36591#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {36587#false} is VALID [2022-04-28 14:58:50,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {36587#false} assume 0 != ~p6~0; {36587#false} is VALID [2022-04-28 14:58:50,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {36587#false} assume 1 != ~lk6~0; {36587#false} is VALID [2022-04-28 14:58:50,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {36587#false} assume !false; {36587#false} is VALID [2022-04-28 14:58:50,548 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 14:58:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:50,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175244634] [2022-04-28 14:58:50,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175244634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:50,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:50,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:50,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:50,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450228330] [2022-04-28 14:58:50,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450228330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:50,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:50,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672154388] [2022-04-28 14:58:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:50,550 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 14:58:50,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:50,550 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 14:58:50,563 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 14:58:50,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:50,564 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 14:58:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:50,913 INFO L93 Difference]: Finished difference Result 1741 states and 2857 transitions. [2022-04-28 14:58:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:50,913 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 14:58:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:50,913 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 14:58:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 14:58:50,915 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 14:58:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 14:58:50,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-28 14:58:51,034 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 14:58:51,104 INFO L225 Difference]: With dead ends: 1741 [2022-04-28 14:58:51,105 INFO L226 Difference]: Without dead ends: 1179 [2022-04-28 14:58:51,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 14:58:51,106 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 14:58:51,107 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 14:58:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-04-28 14:58:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1177. [2022-04-28 14:58:51,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:51,178 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 14:58:51,180 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 14:58:51,182 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 14:58:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:51,227 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-28 14:58:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-28 14:58:51,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:51,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:51,230 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 14:58:51,231 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 14:58:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:51,266 INFO L93 Difference]: Finished difference Result 1179 states and 1912 transitions. [2022-04-28 14:58:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1912 transitions. [2022-04-28 14:58:51,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:51,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:51,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:51,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:51,269 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 14:58:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1911 transitions. [2022-04-28 14:58:51,321 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1911 transitions. Word has length 28 [2022-04-28 14:58:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:51,321 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 1911 transitions. [2022-04-28 14:58:51,321 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 14:58:51,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1177 states and 1911 transitions. [2022-04-28 14:58:53,059 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 14:58:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1911 transitions. [2022-04-28 14:58:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:53,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:53,060 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 14:58:53,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 14:58:53,060 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 1 times [2022-04-28 14:58:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:53,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982975405] [2022-04-28 14:58:53,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1501099116, now seen corresponding path program 2 times [2022-04-28 14:58:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:53,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348202545] [2022-04-28 14:58:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:53,105 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 14:58:53,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 14:58:53,105 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-28 14:58:53,106 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 14:58:53,107 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 14:58:53,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 14:58:53,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #234#return; {44792#true} is VALID [2022-04-28 14:58:53,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret17 := main(); {44792#true} is VALID [2022-04-28 14:58:53,110 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 14:58:53,110 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 14:58:53,110 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 14:58:53,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} assume !(0 != ~p1~0); {44792#true} is VALID [2022-04-28 14:58:53,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {44792#true} assume !(0 != ~p2~0); {44792#true} is VALID [2022-04-28 14:58:53,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {44792#true} assume !(0 != ~p3~0); {44792#true} is VALID [2022-04-28 14:58:53,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {44792#true} assume !(0 != ~p4~0); {44792#true} is VALID [2022-04-28 14:58:53,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {44792#true} assume !(0 != ~p5~0); {44792#true} is VALID [2022-04-28 14:58:53,111 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 14:58:53,111 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 14:58:53,112 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 14:58:53,112 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 14:58:53,112 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 14:58:53,112 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 14:58:53,113 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 14:58:53,113 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 14:58:53,113 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 14:58:53,113 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 14:58:53,114 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 14:58:53,114 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 14:58:53,114 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 14:58:53,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {44797#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {44793#false} is VALID [2022-04-28 14:58:53,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#false} assume !false; {44793#false} is VALID [2022-04-28 14:58:53,115 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 14:58:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:53,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348202545] [2022-04-28 14:58:53,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348202545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:53,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:53,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:53,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:53,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982975405] [2022-04-28 14:58:53,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982975405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:53,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:53,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:53,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292652632] [2022-04-28 14:58:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:53,116 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 14:58:53,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:53,116 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 14:58:53,129 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 14:58:53,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:53,130 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 14:58:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:53,613 INFO L93 Difference]: Finished difference Result 2125 states and 3513 transitions. [2022-04-28 14:58:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:53,614 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 14:58:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:53,614 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 14:58:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 14:58:53,615 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 14:58:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 14:58:53,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-28 14:58:53,698 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 14:58:53,914 INFO L225 Difference]: With dead ends: 2125 [2022-04-28 14:58:53,914 INFO L226 Difference]: Without dead ends: 2123 [2022-04-28 14:58:53,915 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 14:58:53,915 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 14:58:53,915 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 14:58:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-28 14:58:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1673. [2022-04-28 14:58:54,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:54,037 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 14:58:54,041 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 14:58:54,043 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 14:58:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:54,166 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-28 14:58:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-28 14:58:54,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:54,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:54,171 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 14:58:54,173 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 14:58:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:54,288 INFO L93 Difference]: Finished difference Result 2123 states and 3480 transitions. [2022-04-28 14:58:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3480 transitions. [2022-04-28 14:58:54,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:54,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:54,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:54,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:54,293 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 14:58:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2647 transitions. [2022-04-28 14:58:54,428 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2647 transitions. Word has length 28 [2022-04-28 14:58:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:54,429 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 2647 transitions. [2022-04-28 14:58:54,429 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 14:58:54,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1673 states and 2647 transitions. [2022-04-28 14:58:56,805 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 14:58:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2647 transitions. [2022-04-28 14:58:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:58:56,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:58:56,806 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 14:58:56,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 14:58:56,807 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:58:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:58:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 1 times [2022-04-28 14:58:56,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:56,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047163318] [2022-04-28 14:58:56,807 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:58:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash 221235438, now seen corresponding path program 2 times [2022-04-28 14:58:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:58:56,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939774007] [2022-04-28 14:58:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:58:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:58:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:58:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:58:56,872 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 14:58:56,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-28 14:58:56,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-28 14:58:56,873 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 14:58:56,874 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 14:58:56,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {56646#true} assume true; {56646#true} is VALID [2022-04-28 14:58:56,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56646#true} {56646#true} #234#return; {56646#true} is VALID [2022-04-28 14:58:56,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {56646#true} call #t~ret17 := main(); {56646#true} is VALID [2022-04-28 14:58:56,874 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 14:58:56,874 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 14:58:56,874 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 14:58:56,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {56646#true} assume !(0 != ~p1~0); {56646#true} is VALID [2022-04-28 14:58:56,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {56646#true} assume !(0 != ~p2~0); {56646#true} is VALID [2022-04-28 14:58:56,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {56646#true} assume !(0 != ~p3~0); {56646#true} is VALID [2022-04-28 14:58:56,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {56646#true} assume !(0 != ~p4~0); {56646#true} is VALID [2022-04-28 14:58:56,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {56646#true} assume !(0 != ~p5~0); {56646#true} is VALID [2022-04-28 14:58:56,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {56646#true} assume !(0 != ~p6~0); {56651#(= main_~p6~0 0)} is VALID [2022-04-28 14:58:56,875 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 14:58:56,875 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 14:58:56,876 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 14:58:56,876 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 14:58:56,876 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 14:58:56,876 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 14:58:56,877 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 14:58:56,877 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 14:58:56,877 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 14:58:56,877 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 14:58:56,878 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 14:58:56,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {56651#(= main_~p6~0 0)} assume 0 != ~p6~0; {56647#false} is VALID [2022-04-28 14:58:56,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {56647#false} assume 1 != ~lk6~0; {56647#false} is VALID [2022-04-28 14:58:56,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {56647#false} assume !false; {56647#false} is VALID [2022-04-28 14:58:56,878 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 14:58:56,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:58:56,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939774007] [2022-04-28 14:58:56,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939774007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:56,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:56,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:56,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:58:56,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047163318] [2022-04-28 14:58:56,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047163318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:58:56,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:58:56,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:58:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924181155] [2022-04-28 14:58:56,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:58:56,882 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 14:58:56,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:58:56,882 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 14:58:56,895 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 14:58:56,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:58:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:58:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:58:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:58:56,896 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 14:58:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:57,903 INFO L93 Difference]: Finished difference Result 3917 states and 6233 transitions. [2022-04-28 14:58:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:58:57,903 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 14:58:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:58:57,903 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 14:58:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-28 14:58:57,904 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 14:58:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2022-04-28 14:58:57,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 213 transitions. [2022-04-28 14:58:58,026 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 14:58:58,250 INFO L225 Difference]: With dead ends: 3917 [2022-04-28 14:58:58,250 INFO L226 Difference]: Without dead ends: 2283 [2022-04-28 14:58:58,252 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 14:58:58,253 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 14:58:58,253 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 14:58:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-04-28 14:58:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2281. [2022-04-28 14:58:58,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:58:58,417 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 14:58:58,419 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 14:58:58,421 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 14:58:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:58,561 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-28 14:58:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-28 14:58:58,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:58,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:58,566 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 14:58:58,569 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 14:58:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:58:58,711 INFO L93 Difference]: Finished difference Result 2283 states and 3592 transitions. [2022-04-28 14:58:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3592 transitions. [2022-04-28 14:58:58,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:58:58,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:58:58,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:58:58,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:58:58,716 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 14:58:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3591 transitions. [2022-04-28 14:58:59,010 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3591 transitions. Word has length 28 [2022-04-28 14:58:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:58:59,010 INFO L495 AbstractCegarLoop]: Abstraction has 2281 states and 3591 transitions. [2022-04-28 14:58:59,010 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 14:58:59,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2281 states and 3591 transitions. [2022-04-28 14:59:02,405 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 14:59:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3591 transitions. [2022-04-28 14:59:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:59:02,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:02,407 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 14:59:02,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 14:59:02,407 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 1 times [2022-04-28 14:59:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910899732] [2022-04-28 14:59:02,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash -710353220, now seen corresponding path program 2 times [2022-04-28 14:59:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:02,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059505282] [2022-04-28 14:59:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:02,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:02,453 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 14:59:02,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-28 14:59:02,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-28 14:59:02,454 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 14:59:02,454 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 14:59:02,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {73620#true} assume true; {73620#true} is VALID [2022-04-28 14:59:02,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73620#true} {73620#true} #234#return; {73620#true} is VALID [2022-04-28 14:59:02,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {73620#true} call #t~ret17 := main(); {73620#true} is VALID [2022-04-28 14:59:02,454 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 14:59:02,455 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 14:59:02,455 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 14:59:02,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {73620#true} assume !(0 != ~p1~0); {73620#true} is VALID [2022-04-28 14:59:02,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {73620#true} assume !(0 != ~p2~0); {73620#true} is VALID [2022-04-28 14:59:02,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {73620#true} assume !(0 != ~p3~0); {73620#true} is VALID [2022-04-28 14:59:02,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {73620#true} assume !(0 != ~p4~0); {73620#true} is VALID [2022-04-28 14:59:02,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {73620#true} assume !(0 != ~p5~0); {73620#true} is VALID [2022-04-28 14:59:02,455 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 14:59:02,456 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 14:59:02,456 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 14:59:02,456 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 14:59:02,456 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 14:59:02,457 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 14:59:02,457 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 14:59:02,457 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 14:59:02,457 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 14:59:02,458 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 14:59:02,467 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 14:59:02,467 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 14:59:02,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {73625#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {73621#false} is VALID [2022-04-28 14:59:02,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {73621#false} assume 0 != ~p7~0; {73621#false} is VALID [2022-04-28 14:59:02,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {73621#false} assume 1 != ~lk7~0; {73621#false} is VALID [2022-04-28 14:59:02,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {73621#false} assume !false; {73621#false} is VALID [2022-04-28 14:59:02,468 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 14:59:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:02,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059505282] [2022-04-28 14:59:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059505282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:02,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:02,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:02,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910899732] [2022-04-28 14:59:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910899732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:02,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:02,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293459234] [2022-04-28 14:59:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:02,469 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 14:59:02,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:02,470 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 14:59:02,484 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 14:59:02,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:02,485 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 14:59:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:03,295 INFO L93 Difference]: Finished difference Result 3421 states and 5369 transitions. [2022-04-28 14:59:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:03,295 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 14:59:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:03,296 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 14:59:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 14:59:03,297 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 14:59:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 14:59:03,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-28 14:59:03,425 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 14:59:03,659 INFO L225 Difference]: With dead ends: 3421 [2022-04-28 14:59:03,659 INFO L226 Difference]: Without dead ends: 2315 [2022-04-28 14:59:03,661 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 14:59:03,661 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 14:59:03,661 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 14:59:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2022-04-28 14:59:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2313. [2022-04-28 14:59:03,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:03,846 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 14:59:03,848 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 14:59:03,849 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 14:59:03,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:03,988 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-28 14:59:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-28 14:59:03,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:03,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:03,993 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 14:59:03,994 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 14:59:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:04,126 INFO L93 Difference]: Finished difference Result 2315 states and 3592 transitions. [2022-04-28 14:59:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3592 transitions. [2022-04-28 14:59:04,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:04,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:04,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:04,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:04,131 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 14:59:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3591 transitions. [2022-04-28 14:59:04,376 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3591 transitions. Word has length 29 [2022-04-28 14:59:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:04,376 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3591 transitions. [2022-04-28 14:59:04,376 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 14:59:04,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 3591 transitions. [2022-04-28 14:59:07,804 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 14:59:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3591 transitions. [2022-04-28 14:59:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:59:07,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:07,806 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 14:59:07,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 14:59:07,807 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 1 times [2022-04-28 14:59:07,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:07,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [44651649] [2022-04-28 14:59:07,807 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1731421574, now seen corresponding path program 2 times [2022-04-28 14:59:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:07,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247025346] [2022-04-28 14:59:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:07,850 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 14:59:07,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-28 14:59:07,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-28 14:59:07,850 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 14:59:07,850 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 14:59:07,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {89730#true} assume true; {89730#true} is VALID [2022-04-28 14:59:07,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89730#true} {89730#true} #234#return; {89730#true} is VALID [2022-04-28 14:59:07,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {89730#true} call #t~ret17 := main(); {89730#true} is VALID [2022-04-28 14:59:07,851 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 14:59:07,851 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 14:59:07,851 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 14:59:07,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {89730#true} assume !(0 != ~p1~0); {89730#true} is VALID [2022-04-28 14:59:07,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {89730#true} assume !(0 != ~p2~0); {89730#true} is VALID [2022-04-28 14:59:07,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {89730#true} assume !(0 != ~p3~0); {89730#true} is VALID [2022-04-28 14:59:07,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {89730#true} assume !(0 != ~p4~0); {89730#true} is VALID [2022-04-28 14:59:07,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {89730#true} assume !(0 != ~p5~0); {89730#true} is VALID [2022-04-28 14:59:07,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {89730#true} assume !(0 != ~p6~0); {89730#true} is VALID [2022-04-28 14:59:07,853 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 14:59:07,859 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 14:59:07,859 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 14:59:07,862 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 14:59:07,862 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 14:59:07,862 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 14:59:07,863 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 14:59:07,863 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 14:59:07,863 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 14:59:07,863 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 14:59:07,864 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 14:59:07,864 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 14:59:07,865 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 14:59:07,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {89735#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {89731#false} is VALID [2022-04-28 14:59:07,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {89731#false} assume !false; {89731#false} is VALID [2022-04-28 14:59:07,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 14:59:07,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:07,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247025346] [2022-04-28 14:59:07,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247025346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:07,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:07,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:07,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:07,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [44651649] [2022-04-28 14:59:07,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [44651649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:07,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:07,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028819549] [2022-04-28 14:59:07,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:07,866 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 14:59:07,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:07,867 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 14:59:07,881 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 14:59:07,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:07,882 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 14:59:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:08,996 INFO L93 Difference]: Finished difference Result 4109 states and 6505 transitions. [2022-04-28 14:59:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:08,996 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 14:59:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:08,996 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 14:59:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 14:59:08,997 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 14:59:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 14:59:08,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-28 14:59:09,078 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 14:59:09,795 INFO L225 Difference]: With dead ends: 4109 [2022-04-28 14:59:09,795 INFO L226 Difference]: Without dead ends: 4107 [2022-04-28 14:59:09,796 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 14:59:09,796 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 14:59:09,797 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 14:59:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-28 14:59:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3337. [2022-04-28 14:59:10,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:10,059 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 14:59:10,061 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 14:59:10,063 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 14:59:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:10,540 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-28 14:59:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-28 14:59:10,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:10,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:10,548 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 14:59:10,550 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 14:59:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:11,040 INFO L93 Difference]: Finished difference Result 4107 states and 6440 transitions. [2022-04-28 14:59:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 6440 transitions. [2022-04-28 14:59:11,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:11,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:11,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:11,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:11,048 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 14:59:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5031 transitions. [2022-04-28 14:59:11,580 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5031 transitions. Word has length 29 [2022-04-28 14:59:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:11,580 INFO L495 AbstractCegarLoop]: Abstraction has 3337 states and 5031 transitions. [2022-04-28 14:59:11,581 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 14:59:11,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3337 states and 5031 transitions. [2022-04-28 14:59:16,425 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 14:59:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5031 transitions. [2022-04-28 14:59:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:59:16,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:16,429 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 14:59:16,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 14:59:16,429 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:16,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 1 times [2022-04-28 14:59:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:16,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467975220] [2022-04-28 14:59:16,430 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1283682044, now seen corresponding path program 2 times [2022-04-28 14:59:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:16,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620039216] [2022-04-28 14:59:16,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:16,459 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 14:59:16,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-28 14:59:16,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-28 14:59:16,460 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 14:59:16,460 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 14:59:16,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {112848#true} assume true; {112848#true} is VALID [2022-04-28 14:59:16,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112848#true} {112848#true} #234#return; {112848#true} is VALID [2022-04-28 14:59:16,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {112848#true} call #t~ret17 := main(); {112848#true} is VALID [2022-04-28 14:59:16,460 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 14:59:16,463 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 14:59:16,463 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 14:59:16,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {112848#true} assume !(0 != ~p1~0); {112848#true} is VALID [2022-04-28 14:59:16,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {112848#true} assume !(0 != ~p2~0); {112848#true} is VALID [2022-04-28 14:59:16,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {112848#true} assume !(0 != ~p3~0); {112848#true} is VALID [2022-04-28 14:59:16,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {112848#true} assume !(0 != ~p4~0); {112848#true} is VALID [2022-04-28 14:59:16,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {112848#true} assume !(0 != ~p5~0); {112848#true} is VALID [2022-04-28 14:59:16,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {112848#true} assume !(0 != ~p6~0); {112848#true} is VALID [2022-04-28 14:59:16,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {112848#true} assume !(0 != ~p7~0); {112853#(= main_~p7~0 0)} is VALID [2022-04-28 14:59:16,464 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 14:59:16,464 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 14:59:16,465 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 14:59:16,465 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 14:59:16,465 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 14:59:16,465 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 14:59:16,466 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 14:59:16,466 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 14:59:16,466 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 14:59:16,466 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 14:59:16,467 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 14:59:16,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {112853#(= main_~p7~0 0)} assume 0 != ~p7~0; {112849#false} is VALID [2022-04-28 14:59:16,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {112849#false} assume 1 != ~lk7~0; {112849#false} is VALID [2022-04-28 14:59:16,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {112849#false} assume !false; {112849#false} is VALID [2022-04-28 14:59:16,467 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 14:59:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:16,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620039216] [2022-04-28 14:59:16,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620039216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:16,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:16,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:16,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:16,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467975220] [2022-04-28 14:59:16,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467975220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:16,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:16,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678020863] [2022-04-28 14:59:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:16,468 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 14:59:16,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:16,468 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 14:59:16,482 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 14:59:16,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:16,483 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 14:59:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:19,515 INFO L93 Difference]: Finished difference Result 7757 states and 11753 transitions. [2022-04-28 14:59:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:19,515 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 14:59:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:19,515 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 14:59:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 14:59:19,516 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 14:59:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 14:59:19,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-28 14:59:19,636 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 14:59:20,494 INFO L225 Difference]: With dead ends: 7757 [2022-04-28 14:59:20,494 INFO L226 Difference]: Without dead ends: 4491 [2022-04-28 14:59:20,498 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 14:59:20,498 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 14:59:20,498 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 14:59:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2022-04-28 14:59:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2022-04-28 14:59:20,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:20,826 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 14:59:20,829 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 14:59:20,832 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 14:59:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:21,352 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-28 14:59:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-28 14:59:21,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:21,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:21,361 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 14:59:21,363 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 14:59:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:21,852 INFO L93 Difference]: Finished difference Result 4491 states and 6728 transitions. [2022-04-28 14:59:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6728 transitions. [2022-04-28 14:59:21,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:21,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:21,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:21,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:21,861 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 14:59:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6727 transitions. [2022-04-28 14:59:22,719 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6727 transitions. Word has length 29 [2022-04-28 14:59:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:22,720 INFO L495 AbstractCegarLoop]: Abstraction has 4489 states and 6727 transitions. [2022-04-28 14:59:22,720 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 14:59:22,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4489 states and 6727 transitions. [2022-04-28 14:59:29,464 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 14:59:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6727 transitions. [2022-04-28 14:59:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:59:29,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:29,467 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 14:59:29,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 14:59:29,467 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 1 times [2022-04-28 14:59:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:29,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854633903] [2022-04-28 14:59:29,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2134246461, now seen corresponding path program 2 times [2022-04-28 14:59:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:29,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653252875] [2022-04-28 14:59:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:29,505 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 14:59:29,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 14:59:29,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-28 14:59:29,506 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 14:59:29,506 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 14:59:29,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 14:59:29,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #234#return; {146334#true} is VALID [2022-04-28 14:59:29,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-28 14:59:29,506 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 14:59:29,506 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 14:59:29,506 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 14:59:29,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {146334#true} assume !(0 != ~p1~0); {146334#true} is VALID [2022-04-28 14:59:29,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {146334#true} assume !(0 != ~p2~0); {146334#true} is VALID [2022-04-28 14:59:29,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {146334#true} assume !(0 != ~p3~0); {146334#true} is VALID [2022-04-28 14:59:29,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {146334#true} assume !(0 != ~p4~0); {146334#true} is VALID [2022-04-28 14:59:29,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {146334#true} assume !(0 != ~p5~0); {146334#true} is VALID [2022-04-28 14:59:29,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {146334#true} assume !(0 != ~p6~0); {146334#true} is VALID [2022-04-28 14:59:29,507 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 14:59:29,507 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 14:59:29,507 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 14:59:29,508 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 14:59:29,508 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 14:59:29,508 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 14:59:29,508 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 14:59:29,509 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 14:59:29,509 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 14:59:29,509 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 14:59:29,509 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 14:59:29,509 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 14:59:29,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {146339#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {146335#false} is VALID [2022-04-28 14:59:29,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {146335#false} assume 0 != ~p8~0; {146335#false} is VALID [2022-04-28 14:59:29,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {146335#false} assume 1 != ~lk8~0; {146335#false} is VALID [2022-04-28 14:59:29,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-28 14:59:29,510 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 14:59:29,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:29,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653252875] [2022-04-28 14:59:29,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653252875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:29,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:29,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:29,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:29,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854633903] [2022-04-28 14:59:29,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854633903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:29,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:29,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:29,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491857943] [2022-04-28 14:59:29,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:29,511 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 14:59:29,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:29,511 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 14:59:29,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:59:29,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:29,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:29,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:29,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:29,526 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 14:59:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:31,921 INFO L93 Difference]: Finished difference Result 6733 states and 10057 transitions. [2022-04-28 14:59:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:31,921 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 14:59:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:31,922 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 14:59:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 14:59:31,923 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 14:59:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 14:59:31,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-28 14:59:32,038 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 14:59:32,879 INFO L225 Difference]: With dead ends: 6733 [2022-04-28 14:59:32,879 INFO L226 Difference]: Without dead ends: 4555 [2022-04-28 14:59:32,882 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 14:59:32,882 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 14:59:32,882 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 14:59:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2022-04-28 14:59:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4553. [2022-04-28 14:59:33,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:33,192 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 14:59:33,195 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 14:59:33,198 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 14:59:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:33,700 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-28 14:59:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-28 14:59:33,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:33,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:33,709 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 14:59:33,712 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 14:59:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:34,214 INFO L93 Difference]: Finished difference Result 4555 states and 6728 transitions. [2022-04-28 14:59:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 6728 transitions. [2022-04-28 14:59:34,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:34,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:34,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:34,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:34,223 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 14:59:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 6727 transitions. [2022-04-28 14:59:35,082 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 6727 transitions. Word has length 30 [2022-04-28 14:59:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:35,082 INFO L495 AbstractCegarLoop]: Abstraction has 4553 states and 6727 transitions. [2022-04-28 14:59:35,082 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 14:59:35,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4553 states and 6727 transitions. [2022-04-28 14:59:41,670 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 14:59:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 6727 transitions. [2022-04-28 14:59:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:59:41,673 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:59:41,673 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 14:59:41,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 14:59:41,673 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:59:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:59:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 1 times [2022-04-28 14:59:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:41,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075124131] [2022-04-28 14:59:41,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:59:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1139652481, now seen corresponding path program 2 times [2022-04-28 14:59:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:59:41,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446888191] [2022-04-28 14:59:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:59:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:59:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:59:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:59:41,711 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 14:59:41,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-28 14:59:41,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-28 14:59:41,711 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 14:59:41,711 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 14:59:41,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {178028#true} assume true; {178028#true} is VALID [2022-04-28 14:59:41,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178028#true} {178028#true} #234#return; {178028#true} is VALID [2022-04-28 14:59:41,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {178028#true} call #t~ret17 := main(); {178028#true} is VALID [2022-04-28 14:59:41,712 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 14:59:41,712 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 14:59:41,712 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 14:59:41,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {178028#true} assume !(0 != ~p1~0); {178028#true} is VALID [2022-04-28 14:59:41,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {178028#true} assume !(0 != ~p2~0); {178028#true} is VALID [2022-04-28 14:59:41,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {178028#true} assume !(0 != ~p3~0); {178028#true} is VALID [2022-04-28 14:59:41,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {178028#true} assume !(0 != ~p4~0); {178028#true} is VALID [2022-04-28 14:59:41,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {178028#true} assume !(0 != ~p5~0); {178028#true} is VALID [2022-04-28 14:59:41,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {178028#true} assume !(0 != ~p6~0); {178028#true} is VALID [2022-04-28 14:59:41,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {178028#true} assume !(0 != ~p7~0); {178028#true} is VALID [2022-04-28 14:59:41,713 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 14:59:41,713 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 14:59:41,713 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 14:59:41,713 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 14:59:41,714 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 14:59:41,714 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 14:59:41,714 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 14:59:41,714 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 14:59:41,715 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 14:59:41,715 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 14:59:41,715 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 14:59:41,715 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 14:59:41,716 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 14:59:41,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {178033#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {178029#false} is VALID [2022-04-28 14:59:41,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {178029#false} assume !false; {178029#false} is VALID [2022-04-28 14:59:41,716 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 14:59:41,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:59:41,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446888191] [2022-04-28 14:59:41,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446888191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:41,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:41,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:41,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:59:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075124131] [2022-04-28 14:59:41,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075124131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:59:41,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:59:41,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:59:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001268134] [2022-04-28 14:59:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:59:41,717 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 14:59:41,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:59:41,718 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 14:59:41,733 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 14:59:41,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:59:41,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:59:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:59:41,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:59:41,734 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 14:59:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:45,092 INFO L93 Difference]: Finished difference Result 7949 states and 11977 transitions. [2022-04-28 14:59:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:59:45,093 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 14:59:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:59:45,093 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 14:59:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 14:59:45,094 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 14:59:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 14:59:45,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 14:59:45,174 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 14:59:47,822 INFO L225 Difference]: With dead ends: 7949 [2022-04-28 14:59:47,822 INFO L226 Difference]: Without dead ends: 7947 [2022-04-28 14:59:47,823 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 14:59:47,824 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 14:59:47,824 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 14:59:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2022-04-28 14:59:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6665. [2022-04-28 14:59:48,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:59:48,313 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 14:59:48,317 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 14:59:48,320 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 14:59:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:49,871 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-28 14:59:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-28 14:59:49,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:49,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:49,882 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 14:59:49,886 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 14:59:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:59:51,479 INFO L93 Difference]: Finished difference Result 7947 states and 11848 transitions. [2022-04-28 14:59:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7947 states and 11848 transitions. [2022-04-28 14:59:51,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:59:51,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:59:51,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:59:51,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:59:51,490 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 14:59:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9543 transitions. [2022-04-28 14:59:53,462 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9543 transitions. Word has length 30 [2022-04-28 14:59:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:59:53,462 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 9543 transitions. [2022-04-28 14:59:53,462 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 14:59:53,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6665 states and 9543 transitions. [2022-04-28 15:00:02,861 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 15:00:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9543 transitions. [2022-04-28 15:00:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 15:00:02,866 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:02,866 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 15:00:02,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:00:02,866 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 1 times [2022-04-28 15:00:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:02,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1004571296] [2022-04-28 15:00:02,867 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash -140211197, now seen corresponding path program 2 times [2022-04-28 15:00:02,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:02,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064907096] [2022-04-28 15:00:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:02,934 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 15:00:02,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-28 15:00:02,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-28 15:00:02,934 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 15:00:02,934 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 15:00:02,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {223162#true} assume true; {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223162#true} {223162#true} #234#return; {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {223162#true} call #t~ret17 := main(); {223162#true} is VALID [2022-04-28 15:00:02,935 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 15:00:02,935 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 15:00:02,935 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 15:00:02,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {223162#true} assume !(0 != ~p1~0); {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {223162#true} assume !(0 != ~p2~0); {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {223162#true} assume !(0 != ~p3~0); {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {223162#true} assume !(0 != ~p4~0); {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {223162#true} assume !(0 != ~p5~0); {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {223162#true} assume !(0 != ~p6~0); {223162#true} is VALID [2022-04-28 15:00:02,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {223162#true} assume !(0 != ~p7~0); {223162#true} is VALID [2022-04-28 15:00:02,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {223162#true} assume !(0 != ~p8~0); {223167#(= main_~p8~0 0)} is VALID [2022-04-28 15:00:02,936 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 15:00:02,936 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 15:00:02,937 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 15:00:02,937 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 15:00:02,937 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 15:00:02,937 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 15:00:02,938 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 15:00:02,938 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 15:00:02,938 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 15:00:02,938 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 15:00:02,939 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 15:00:02,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {223167#(= main_~p8~0 0)} assume 0 != ~p8~0; {223163#false} is VALID [2022-04-28 15:00:02,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {223163#false} assume 1 != ~lk8~0; {223163#false} is VALID [2022-04-28 15:00:02,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {223163#false} assume !false; {223163#false} is VALID [2022-04-28 15:00:02,939 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 15:00:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:02,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064907096] [2022-04-28 15:00:02,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064907096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:02,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:02,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:02,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1004571296] [2022-04-28 15:00:02,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1004571296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:02,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:02,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278275489] [2022-04-28 15:00:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:02,940 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 15:00:02,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:02,941 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 15:00:02,955 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 15:00:02,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:02,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:02,956 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 15:00:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:14,305 INFO L93 Difference]: Finished difference Result 15373 states and 22089 transitions. [2022-04-28 15:00:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:14,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 15:00:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:00:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-28 15:00:14,307 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 15:00:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-04-28 15:00:14,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 207 transitions. [2022-04-28 15:00:14,420 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 15:00:17,745 INFO L225 Difference]: With dead ends: 15373 [2022-04-28 15:00:17,745 INFO L226 Difference]: Without dead ends: 8843 [2022-04-28 15:00:17,755 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 15:00:17,765 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:17,766 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.1s Time] [2022-04-28 15:00:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2022-04-28 15:00:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 8841. [2022-04-28 15:00:18,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:18,455 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 15:00:18,461 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 15:00:18,467 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 15:00:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:20,326 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-28 15:00:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-28 15:00:20,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:20,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:20,340 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 15:00:20,346 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 15:00:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:22,259 INFO L93 Difference]: Finished difference Result 8843 states and 12552 transitions. [2022-04-28 15:00:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 12552 transitions. [2022-04-28 15:00:22,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:22,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:22,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:22,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:22,274 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 15:00:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 12551 transitions. [2022-04-28 15:00:25,598 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 12551 transitions. Word has length 30 [2022-04-28 15:00:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:25,598 INFO L495 AbstractCegarLoop]: Abstraction has 8841 states and 12551 transitions. [2022-04-28 15:00:25,598 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 15:00:25,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8841 states and 12551 transitions. [2022-04-28 15:00:38,549 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 15:00:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 12551 transitions. [2022-04-28 15:00:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:00:38,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:00:38,554 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 15:00:38,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:00:38,554 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:00:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:00:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 1 times [2022-04-28 15:00:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:38,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1660728517] [2022-04-28 15:00:38,554 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:00:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash 969703665, now seen corresponding path program 2 times [2022-04-28 15:00:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:00:38,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367166134] [2022-04-28 15:00:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:00:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:00:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:38,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:00:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:00:38,594 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 15:00:38,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-28 15:00:38,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-28 15:00:38,594 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 15:00:38,595 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 15:00:38,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {289288#true} assume true; {289288#true} is VALID [2022-04-28 15:00:38,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289288#true} {289288#true} #234#return; {289288#true} is VALID [2022-04-28 15:00:38,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {289288#true} call #t~ret17 := main(); {289288#true} is VALID [2022-04-28 15:00:38,595 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 15:00:38,595 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 15:00:38,595 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 15:00:38,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {289288#true} assume !(0 != ~p1~0); {289288#true} is VALID [2022-04-28 15:00:38,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {289288#true} assume !(0 != ~p2~0); {289288#true} is VALID [2022-04-28 15:00:38,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {289288#true} assume !(0 != ~p3~0); {289288#true} is VALID [2022-04-28 15:00:38,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {289288#true} assume !(0 != ~p4~0); {289288#true} is VALID [2022-04-28 15:00:38,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {289288#true} assume !(0 != ~p5~0); {289288#true} is VALID [2022-04-28 15:00:38,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {289288#true} assume !(0 != ~p6~0); {289288#true} is VALID [2022-04-28 15:00:38,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {289288#true} assume !(0 != ~p7~0); {289288#true} is VALID [2022-04-28 15:00:38,596 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 15:00:38,596 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 15:00:38,596 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 15:00:38,597 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 15:00:38,597 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 15:00:38,597 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 15:00:38,597 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 15:00:38,598 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 15:00:38,598 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 15:00:38,598 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 15:00:38,598 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 15:00:38,598 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 15:00:38,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {289293#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {289289#false} is VALID [2022-04-28 15:00:38,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {289289#false} assume 0 != ~p9~0; {289289#false} is VALID [2022-04-28 15:00:38,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {289289#false} assume 1 != ~lk9~0; {289289#false} is VALID [2022-04-28 15:00:38,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {289289#false} assume !false; {289289#false} is VALID [2022-04-28 15:00:38,599 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 15:00:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:00:38,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367166134] [2022-04-28 15:00:38,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367166134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:38,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:38,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:38,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:00:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1660728517] [2022-04-28 15:00:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1660728517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:00:38,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:00:38,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:00:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471767749] [2022-04-28 15:00:38,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:00:38,600 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 15:00:38,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:00:38,600 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 15:00:38,615 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 15:00:38,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:00:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:00:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:00:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:00:38,615 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 15:00:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:47,346 INFO L93 Difference]: Finished difference Result 13261 states and 18761 transitions. [2022-04-28 15:00:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:00:47,347 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 15:00:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:00:47,347 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 15:00:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-28 15:00:47,348 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 15:00:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-28 15:00:47,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-28 15:00:47,463 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 15:00:50,849 INFO L225 Difference]: With dead ends: 13261 [2022-04-28 15:00:50,849 INFO L226 Difference]: Without dead ends: 8971 [2022-04-28 15:00:50,854 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 15:00:50,858 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:00:50,858 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.1s Time] [2022-04-28 15:00:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2022-04-28 15:00:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 8969. [2022-04-28 15:00:51,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:00:51,576 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 15:00:51,585 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 15:00:51,594 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 15:00:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:53,661 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-28 15:00:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-28 15:00:53,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:53,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:53,679 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 15:00:53,689 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 15:00:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:00:55,792 INFO L93 Difference]: Finished difference Result 8971 states and 12552 transitions. [2022-04-28 15:00:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12552 transitions. [2022-04-28 15:00:55,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:00:55,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:00:55,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:00:55,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:00:55,811 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 15:00:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8969 states to 8969 states and 12551 transitions. [2022-04-28 15:00:59,277 INFO L78 Accepts]: Start accepts. Automaton has 8969 states and 12551 transitions. Word has length 31 [2022-04-28 15:00:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:00:59,277 INFO L495 AbstractCegarLoop]: Abstraction has 8969 states and 12551 transitions. [2022-04-28 15:00:59,278 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 15:00:59,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8969 states and 12551 transitions. [2022-04-28 15:01:12,419 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 15:01:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8969 states and 12551 transitions. [2022-04-28 15:01:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:01:12,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:01:12,427 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 15:01:12,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:01:12,427 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:01:12,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:01:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 1 times [2022-04-28 15:01:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:12,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242107110] [2022-04-28 15:01:12,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:01:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -51364689, now seen corresponding path program 2 times [2022-04-28 15:01:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:01:12,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475989358] [2022-04-28 15:01:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:01:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:01:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:01:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:01:12,466 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 15:01:12,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-28 15:01:12,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-28 15:01:12,467 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 15:01:12,467 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 15:01:12,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {351702#true} assume true; {351702#true} is VALID [2022-04-28 15:01:12,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351702#true} {351702#true} #234#return; {351702#true} is VALID [2022-04-28 15:01:12,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {351702#true} call #t~ret17 := main(); {351702#true} is VALID [2022-04-28 15:01:12,467 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 15:01:12,468 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 15:01:12,468 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 15:01:12,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {351702#true} assume !(0 != ~p1~0); {351702#true} is VALID [2022-04-28 15:01:12,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {351702#true} assume !(0 != ~p2~0); {351702#true} is VALID [2022-04-28 15:01:12,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {351702#true} assume !(0 != ~p3~0); {351702#true} is VALID [2022-04-28 15:01:12,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {351702#true} assume !(0 != ~p4~0); {351702#true} is VALID [2022-04-28 15:01:12,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {351702#true} assume !(0 != ~p5~0); {351702#true} is VALID [2022-04-28 15:01:12,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {351702#true} assume !(0 != ~p6~0); {351702#true} is VALID [2022-04-28 15:01:12,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {351702#true} assume !(0 != ~p7~0); {351702#true} is VALID [2022-04-28 15:01:12,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {351702#true} assume !(0 != ~p8~0); {351702#true} is VALID [2022-04-28 15:01:12,468 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 15:01:12,478 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 15:01:12,479 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 15:01:12,479 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 15:01:12,479 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 15:01:12,479 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 15:01:12,480 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 15:01:12,480 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 15:01:12,480 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 15:01:12,481 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 15:01:12,481 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 15:01:12,481 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 15:01:12,481 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 15:01:12,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {351707#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {351703#false} is VALID [2022-04-28 15:01:12,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {351703#false} assume !false; {351703#false} is VALID [2022-04-28 15:01:12,482 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 15:01:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:01:12,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475989358] [2022-04-28 15:01:12,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475989358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:12,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:12,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:12,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:01:12,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242107110] [2022-04-28 15:01:12,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242107110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:01:12,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:01:12,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:01:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836864158] [2022-04-28 15:01:12,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:01:12,483 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 15:01:12,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:01:12,483 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 15:01:12,500 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 15:01:12,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:01:12,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:01:12,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:01:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:01:12,501 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 15:01:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:24,330 INFO L93 Difference]: Finished difference Result 15373 states and 21897 transitions. [2022-04-28 15:01:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:01:24,330 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 15:01:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:01:24,330 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 15:01:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 15:01:24,331 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 15:01:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 15:01:24,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-28 15:01:24,405 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 15:01:34,699 INFO L225 Difference]: With dead ends: 15373 [2022-04-28 15:01:34,699 INFO L226 Difference]: Without dead ends: 15371 [2022-04-28 15:01:34,702 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 15:01:34,702 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 15:01:34,703 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 15:01:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2022-04-28 15:01:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 13321. [2022-04-28 15:01:35,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:01:35,773 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 15:01:35,786 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 15:01:35,799 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 15:01:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:41,915 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-28 15:01:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-28 15:01:41,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:41,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:41,938 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 15:01:41,951 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 15:01:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:01:48,274 INFO L93 Difference]: Finished difference Result 15371 states and 21640 transitions. [2022-04-28 15:01:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 15371 states and 21640 transitions. [2022-04-28 15:01:48,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:01:48,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:01:48,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:01:48,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:01:48,298 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 15:01:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13321 states to 13321 states and 18055 transitions. [2022-04-28 15:01:56,124 INFO L78 Accepts]: Start accepts. Automaton has 13321 states and 18055 transitions. Word has length 31 [2022-04-28 15:01:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:01:56,124 INFO L495 AbstractCegarLoop]: Abstraction has 13321 states and 18055 transitions. [2022-04-28 15:01:56,124 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 15:01:56,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13321 states and 18055 transitions. [2022-04-28 15:02:14,797 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 15:02:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 13321 states and 18055 transitions. [2022-04-28 15:02:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 15:02:14,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:02:14,806 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 15:02:14,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:02:14,807 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:02:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:02:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 1 times [2022-04-28 15:02:14,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:14,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820254709] [2022-04-28 15:02:14,807 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:02:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1331228367, now seen corresponding path program 2 times [2022-04-28 15:02:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:02:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753273166] [2022-04-28 15:02:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:02:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:02:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:02:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:02:14,832 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 15:02:14,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-28 15:02:14,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-28 15:02:14,833 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 15:02:14,833 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 15:02:14,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {439844#true} assume true; {439844#true} is VALID [2022-04-28 15:02:14,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439844#true} {439844#true} #234#return; {439844#true} is VALID [2022-04-28 15:02:14,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {439844#true} call #t~ret17 := main(); {439844#true} is VALID [2022-04-28 15:02:14,833 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 15:02:14,833 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 15:02:14,833 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 15:02:14,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {439844#true} assume !(0 != ~p1~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {439844#true} assume !(0 != ~p2~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {439844#true} assume !(0 != ~p3~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {439844#true} assume !(0 != ~p4~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {439844#true} assume !(0 != ~p5~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {439844#true} assume !(0 != ~p6~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {439844#true} assume !(0 != ~p7~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {439844#true} assume !(0 != ~p8~0); {439844#true} is VALID [2022-04-28 15:02:14,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {439844#true} assume !(0 != ~p9~0); {439849#(= main_~p9~0 0)} is VALID [2022-04-28 15:02:14,834 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 15:02:14,835 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 15:02:14,835 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 15:02:14,835 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 15:02:14,835 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 15:02:14,836 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 15:02:14,836 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 15:02:14,836 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 15:02:14,836 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 15:02:14,836 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 15:02:14,837 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 15:02:14,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {439849#(= main_~p9~0 0)} assume 0 != ~p9~0; {439845#false} is VALID [2022-04-28 15:02:14,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {439845#false} assume 1 != ~lk9~0; {439845#false} is VALID [2022-04-28 15:02:14,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {439845#false} assume !false; {439845#false} is VALID [2022-04-28 15:02:14,837 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 15:02:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:02:14,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753273166] [2022-04-28 15:02:14,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753273166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:14,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:14,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:14,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:02:14,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820254709] [2022-04-28 15:02:14,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820254709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:02:14,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:02:14,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:02:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420165084] [2022-04-28 15:02:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:02:14,838 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 15:02:14,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:02:14,839 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 15:02:14,852 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 15:02:14,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:02:14,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:02:14,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:02:14,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:02:14,853 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 15:03:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:04,193 INFO L93 Difference]: Finished difference Result 30477 states and 41353 transitions. [2022-04-28 15:03:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:03:04,193 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 15:03:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:03:04,193 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 15:03:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 15:03:04,194 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 15:03:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 15:03:04,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-28 15:03:04,305 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 15:03:17,269 INFO L225 Difference]: With dead ends: 30477 [2022-04-28 15:03:17,270 INFO L226 Difference]: Without dead ends: 17419 [2022-04-28 15:03:17,284 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 15:03:17,284 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 15:03:17,284 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 15:03:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2022-04-28 15:03:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 17417. [2022-04-28 15:03:18,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:03:18,692 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 15:03:18,713 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 15:03:18,735 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 15:03:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:25,873 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-28 15:03:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-28 15:03:25,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:25,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:25,951 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 15:03:25,968 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 15:03:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:03:33,043 INFO L93 Difference]: Finished difference Result 17419 states and 23304 transitions. [2022-04-28 15:03:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 23304 transitions. [2022-04-28 15:03:33,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:03:33,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:03:33,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:03:33,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:03:33,072 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 15:03:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 23303 transitions. [2022-04-28 15:03:45,875 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 23303 transitions. Word has length 31 [2022-04-28 15:03:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:03:45,875 INFO L495 AbstractCegarLoop]: Abstraction has 17417 states and 23303 transitions. [2022-04-28 15:03:45,875 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 15:03:45,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17417 states and 23303 transitions. [2022-04-28 15:04:10,324 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 15:04:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 23303 transitions. [2022-04-28 15:04:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 15:04:10,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:04:10,334 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 15:04:10,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:04:10,334 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:04:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:04:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 1 times [2022-04-28 15:04:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:10,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704055029] [2022-04-28 15:04:10,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:04:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1592089896, now seen corresponding path program 2 times [2022-04-28 15:04:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:04:10,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564334037] [2022-04-28 15:04:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:04:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:04:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:04:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:04:10,367 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 15:04:10,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-28 15:04:10,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-28 15:04:10,368 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 15:04:10,368 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 15:04:10,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {570482#true} assume true; {570482#true} is VALID [2022-04-28 15:04:10,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570482#true} {570482#true} #234#return; {570482#true} is VALID [2022-04-28 15:04:10,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {570482#true} call #t~ret17 := main(); {570482#true} is VALID [2022-04-28 15:04:10,368 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 15:04:10,368 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 15:04:10,368 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 15:04:10,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {570482#true} assume !(0 != ~p1~0); {570482#true} is VALID [2022-04-28 15:04:10,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {570482#true} assume !(0 != ~p2~0); {570482#true} is VALID [2022-04-28 15:04:10,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {570482#true} assume !(0 != ~p3~0); {570482#true} is VALID [2022-04-28 15:04:10,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {570482#true} assume !(0 != ~p4~0); {570482#true} is VALID [2022-04-28 15:04:10,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {570482#true} assume !(0 != ~p5~0); {570482#true} is VALID [2022-04-28 15:04:10,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {570482#true} assume !(0 != ~p6~0); {570482#true} is VALID [2022-04-28 15:04:10,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {570482#true} assume !(0 != ~p7~0); {570482#true} is VALID [2022-04-28 15:04:10,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {570482#true} assume !(0 != ~p8~0); {570482#true} is VALID [2022-04-28 15:04:10,369 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 15:04:10,369 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 15:04:10,370 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 15:04:10,370 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 15:04:10,370 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 15:04:10,370 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 15:04:10,371 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 15:04:10,371 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 15:04:10,371 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 15:04:10,371 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 15:04:10,372 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 15:04:10,372 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 15:04:10,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {570487#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {570483#false} is VALID [2022-04-28 15:04:10,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {570483#false} assume 0 != ~p10~0; {570483#false} is VALID [2022-04-28 15:04:10,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {570483#false} assume 1 != ~lk10~0; {570483#false} is VALID [2022-04-28 15:04:10,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {570483#false} assume !false; {570483#false} is VALID [2022-04-28 15:04:10,372 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 15:04:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:04:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564334037] [2022-04-28 15:04:10,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564334037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:10,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:10,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:04:10,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:04:10,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704055029] [2022-04-28 15:04:10,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704055029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:04:10,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:04:10,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:04:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001675597] [2022-04-28 15:04:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:04:10,374 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 15:04:10,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:04:10,374 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 15:04:10,388 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 15:04:10,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:04:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:04:10,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:04:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:04:10,389 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 15:04:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:04:44,136 INFO L93 Difference]: Finished difference Result 26125 states and 34825 transitions. [2022-04-28 15:04:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:04:44,136 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 15:04:44,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:04:44,136 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 15:04:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 15:04:44,137 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 15:04:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 15:04:44,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-28 15:04:44,248 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 15:04:58,309 INFO L225 Difference]: With dead ends: 26125 [2022-04-28 15:04:58,309 INFO L226 Difference]: Without dead ends: 17675 [2022-04-28 15:04:58,320 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 15:04:58,320 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 15:04:58,320 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 15:04:58,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-04-28 15:04:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 17673. [2022-04-28 15:04:59,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:04:59,799 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 15:04:59,816 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 15:04:59,834 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 15:05:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:05:07,841 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-28 15:05:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-28 15:05:07,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:05:07,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:05:07,872 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 15:05:07,891 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 15:05:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:05:16,059 INFO L93 Difference]: Finished difference Result 17675 states and 23304 transitions. [2022-04-28 15:05:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 17675 states and 23304 transitions. [2022-04-28 15:05:16,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:05:16,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:05:16,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:05:16,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:05:16,090 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 15:05:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17673 states to 17673 states and 23303 transitions. [2022-04-28 15:05:29,821 INFO L78 Accepts]: Start accepts. Automaton has 17673 states and 23303 transitions. Word has length 32 [2022-04-28 15:05:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:05:29,821 INFO L495 AbstractCegarLoop]: Abstraction has 17673 states and 23303 transitions. [2022-04-28 15:05:29,821 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 15:05:29,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17673 states and 23303 transitions. [2022-04-28 15:05:54,652 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 15:05:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17673 states and 23303 transitions. [2022-04-28 15:05:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 15:05:54,662 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:05:54,662 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 15:05:54,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:05:54,662 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:05:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:05:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 1 times [2022-04-28 15:05:54,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:05:54,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1795076770] [2022-04-28 15:05:54,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:05:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1681809046, now seen corresponding path program 2 times [2022-04-28 15:05:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:05:54,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446045611] [2022-04-28 15:05:54,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:05:54,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:05:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:05:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:05:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:05:54,695 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 15:05:54,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-28 15:05:54,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-28 15:05:54,696 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 15:05:54,696 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 15:05:54,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {693440#true} assume true; {693440#true} is VALID [2022-04-28 15:05:54,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693440#true} {693440#true} #234#return; {693440#true} is VALID [2022-04-28 15:05:54,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {693440#true} call #t~ret17 := main(); {693440#true} is VALID [2022-04-28 15:05:54,697 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 15:05:54,697 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 15:05:54,697 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 15:05:54,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {693440#true} assume !(0 != ~p1~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {693440#true} assume !(0 != ~p2~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {693440#true} assume !(0 != ~p3~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {693440#true} assume !(0 != ~p4~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {693440#true} assume !(0 != ~p5~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {693440#true} assume !(0 != ~p6~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {693440#true} assume !(0 != ~p7~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {693440#true} assume !(0 != ~p8~0); {693440#true} is VALID [2022-04-28 15:05:54,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {693440#true} assume !(0 != ~p9~0); {693440#true} is VALID [2022-04-28 15:05:54,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {693440#true} assume !(0 != ~p10~0); {693445#(= main_~p10~0 0)} is VALID [2022-04-28 15:05:54,701 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 15:05:54,701 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 15:05:54,701 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 15:05:54,702 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 15:05:54,702 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 15:05:54,702 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 15:05:54,702 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 15:05:54,703 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 15:05:54,703 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 15:05:54,703 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 15:05:54,704 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 15:05:54,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {693445#(= main_~p10~0 0)} assume 0 != ~p10~0; {693441#false} is VALID [2022-04-28 15:05:54,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {693441#false} assume 1 != ~lk10~0; {693441#false} is VALID [2022-04-28 15:05:54,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {693441#false} assume !false; {693441#false} is VALID [2022-04-28 15:05:54,704 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 15:05:54,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:05:54,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446045611] [2022-04-28 15:05:54,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446045611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:05:54,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:05:54,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:05:54,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:05:54,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1795076770] [2022-04-28 15:05:54,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1795076770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:05:54,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:05:54,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:05:54,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966806304] [2022-04-28 15:05:54,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:05:54,705 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 15:05:54,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:05:54,706 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 15:05:54,721 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 15:05:54,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:05:54,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:05:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:05:54,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:05:54,722 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) [2022-04-28 15:11:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:11:37,082 INFO L93 Difference]: Finished difference Result 51469 states and 66825 transitions. [2022-04-28 15:11:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:11:37,082 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 15:11:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:11:37,082 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 15:11:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-28 15:11:37,083 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 15:11:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-04-28 15:11:37,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-04-28 15:11:37,194 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 15:12:32,901 INFO L225 Difference]: With dead ends: 51469 [2022-04-28 15:12:32,901 INFO L226 Difference]: Without dead ends: 34315 [2022-04-28 15:12:32,925 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 15:12:32,925 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 99 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 15:12:32,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 99 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 15:12:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34315 states. [2022-04-28 15:12:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34315 to 34313. [2022-04-28 15:12:35,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:12:35,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 2 states have call successors, (2), 2 states 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 15:12:35,939 INFO L74 IsIncluded]: Start isIncluded. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 2 states have call successors, (2), 2 states 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 15:12:35,980 INFO L87 Difference]: Start difference. First operand 34315 states. Second operand has 34313 states, 34309 states have (on average 1.2685884170334314) internal successors, (43524), 34309 states have internal predecessors, (43524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)