./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c4f91361 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 15:36:18,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 15:36:18,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 15:36:18,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 15:36:18,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 15:36:18,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 15:36:18,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 15:36:18,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 15:36:18,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 15:36:18,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 15:36:18,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 15:36:18,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 15:36:18,347 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 15:36:18,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 15:36:18,347 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 15:36:18,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 15:36:18,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 15:36:18,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 15:36:18,349 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 15:36:18,349 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 15:36:18,349 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 15:36:18,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 15:36:18,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 15:36:18,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 15:36:18,370 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 15:36:18,370 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 15:36:18,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 15:36:18,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 15:36:18,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 15:36:18,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 15:36:18,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:36:18,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 15:36:18,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 15:36:18,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 15:36:18,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 15:36:18,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 15:36:18,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 15:36:18,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 15:36:18,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 15:36:18,373 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 [2023-11-23 15:36:18,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 15:36:18,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 15:36:18,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 15:36:18,600 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 15:36:18,601 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 15:36:18,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2023-11-23 15:36:19,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 15:36:19,791 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 15:36:19,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-with-pointer/simple-recursive.c [2023-11-23 15:36:19,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a00a68c/b1cef5c511fd4292a9a4a29d1d5ec667/FLAGebef4874a [2023-11-23 15:36:19,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a00a68c/b1cef5c511fd4292a9a4a29d1d5ec667 [2023-11-23 15:36:19,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 15:36:19,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 15:36:19,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 15:36:19,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 15:36:19,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 15:36:19,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:19,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189badb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19, skipping insertion in model container [2023-11-23 15:36:19,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:19,828 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 15:36:19,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:36:19,944 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 15:36:19,955 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 15:36:19,967 INFO L206 MainTranslator]: Completed translation [2023-11-23 15:36:19,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19 WrapperNode [2023-11-23 15:36:19,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 15:36:19,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 15:36:19,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 15:36:19,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 15:36:19,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:19,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:19,992 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2023-11-23 15:36:19,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 15:36:19,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 15:36:19,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 15:36:19,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 15:36:19,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:19,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 15:36:20,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 15:36:20,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 15:36:20,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 15:36:20,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (1/1) ... [2023-11-23 15:36:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 15:36:20,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:36:20,061 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) [2023-11-23 15:36:20,120 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 [2023-11-23 15:36:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 15:36:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2023-11-23 15:36:20,151 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2023-11-23 15:36:20,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 15:36:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 15:36:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2023-11-23 15:36:20,152 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2023-11-23 15:36:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 15:36:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 15:36:20,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 15:36:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 15:36:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 15:36:20,211 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 15:36:20,212 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 15:36:20,332 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 15:36:20,369 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 15:36:20,369 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 15:36:20,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:20 BoogieIcfgContainer [2023-11-23 15:36:20,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 15:36:20,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 15:36:20,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 15:36:20,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 15:36:20,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:36:19" (1/3) ... [2023-11-23 15:36:20,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3624012f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:20, skipping insertion in model container [2023-11-23 15:36:20,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:19" (2/3) ... [2023-11-23 15:36:20,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3624012f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:20, skipping insertion in model container [2023-11-23 15:36:20,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:20" (3/3) ... [2023-11-23 15:36:20,379 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2023-11-23 15:36:20,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 15:36:20,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-23 15:36:20,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 15:36:20,432 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@222bedaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 15:36:20,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-23 15:36:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 15:36:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 15:36:20,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:20,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 15:36:20,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:20,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2726, now seen corresponding path program 1 times [2023-11-23 15:36:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213904996] [2023-11-23 15:36:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:20,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:20,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213904996] [2023-11-23 15:36:20,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213904996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:36:20,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:36:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 15:36:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57036924] [2023-11-23 15:36:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:36:20,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:36:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:20,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:36:20,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:36:20,673 INFO L87 Difference]: Start difference. First operand has 33 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:20,707 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-11-23 15:36:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:36:20,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 15:36:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:20,722 INFO L225 Difference]: With dead ends: 32 [2023-11-23 15:36:20,722 INFO L226 Difference]: Without dead ends: 31 [2023-11-23 15:36:20,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:36:20,726 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:20,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:36:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-23 15:36:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-23 15:36:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 26 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 15:36:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-11-23 15:36:20,749 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 2 [2023-11-23 15:36:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:20,749 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-11-23 15:36:20,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-11-23 15:36:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 15:36:20,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:20,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 15:36:20,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 15:36:20,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:20,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2727, now seen corresponding path program 1 times [2023-11-23 15:36:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024762766] [2023-11-23 15:36:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024762766] [2023-11-23 15:36:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024762766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:36:20,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:36:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 15:36:20,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292868813] [2023-11-23 15:36:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:36:20,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 15:36:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 15:36:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:36:20,833 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:20,861 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-23 15:36:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 15:36:20,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 15:36:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:20,862 INFO L225 Difference]: With dead ends: 30 [2023-11-23 15:36:20,863 INFO L226 Difference]: Without dead ends: 30 [2023-11-23 15:36:20,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 15:36:20,864 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:20,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:36:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-23 15:36:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-23 15:36:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 25 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 15:36:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-11-23 15:36:20,867 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 2 [2023-11-23 15:36:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:20,868 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-11-23 15:36:20,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-11-23 15:36:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 15:36:20,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:20,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 15:36:20,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 15:36:20,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:20,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 81228527, now seen corresponding path program 1 times [2023-11-23 15:36:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297744412] [2023-11-23 15:36:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:20,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297744412] [2023-11-23 15:36:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297744412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:36:20,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:36:20,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:36:20,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355137657] [2023-11-23 15:36:20,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:36:20,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:36:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:20,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:36:20,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:36:20,939 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:21,040 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2023-11-23 15:36:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:36:21,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 15:36:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:21,043 INFO L225 Difference]: With dead ends: 41 [2023-11-23 15:36:21,043 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 15:36:21,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:36:21,049 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:21,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 43 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:36:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 15:36:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-11-23 15:36:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.619047619047619) internal successors, (34), 31 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:36:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-23 15:36:21,058 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 5 [2023-11-23 15:36:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:21,059 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-23 15:36:21,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-23 15:36:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 15:36:21,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:21,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 15:36:21,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 15:36:21,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:21,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash 81228528, now seen corresponding path program 1 times [2023-11-23 15:36:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523063567] [2023-11-23 15:36:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:21,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523063567] [2023-11-23 15:36:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523063567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:36:21,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:36:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 15:36:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959511169] [2023-11-23 15:36:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:36:21,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:36:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:21,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:36:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:36:21,175 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:21,224 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-11-23 15:36:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:36:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 15:36:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:21,227 INFO L225 Difference]: With dead ends: 39 [2023-11-23 15:36:21,227 INFO L226 Difference]: Without dead ends: 39 [2023-11-23 15:36:21,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:36:21,235 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:21,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 61 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:36:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-23 15:36:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-11-23 15:36:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 31 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:36:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-11-23 15:36:21,247 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 5 [2023-11-23 15:36:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:21,247 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-11-23 15:36:21,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-11-23 15:36:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 15:36:21,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:21,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:36:21,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 15:36:21,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:21,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash 350994170, now seen corresponding path program 1 times [2023-11-23 15:36:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665206619] [2023-11-23 15:36:21,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:21,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665206619] [2023-11-23 15:36:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665206619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:36:21,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:36:21,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 15:36:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266882878] [2023-11-23 15:36:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:36:21,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:36:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:36:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:36:21,322 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:21,393 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2023-11-23 15:36:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 15:36:21,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 15:36:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:21,395 INFO L225 Difference]: With dead ends: 34 [2023-11-23 15:36:21,395 INFO L226 Difference]: Without dead ends: 34 [2023-11-23 15:36:21,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 15:36:21,396 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:21,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:36:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-23 15:36:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-23 15:36:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.380952380952381) internal successors, (29), 28 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:36:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2023-11-23 15:36:21,403 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2023-11-23 15:36:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:21,404 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-11-23 15:36:21,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2023-11-23 15:36:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 15:36:21,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:21,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:36:21,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 15:36:21,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:21,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 350994171, now seen corresponding path program 1 times [2023-11-23 15:36:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:21,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206854173] [2023-11-23 15:36:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206854173] [2023-11-23 15:36:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206854173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:36:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:36:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 15:36:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382866262] [2023-11-23 15:36:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:36:21,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 15:36:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:21,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 15:36:21,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 15:36:21,554 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:21,614 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-11-23 15:36:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 15:36:21,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 15:36:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:21,616 INFO L225 Difference]: With dead ends: 30 [2023-11-23 15:36:21,617 INFO L226 Difference]: Without dead ends: 30 [2023-11-23 15:36:21,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 15:36:21,618 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:21,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:36:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-23 15:36:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-23 15:36:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:36:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-23 15:36:21,630 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 9 [2023-11-23 15:36:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:21,631 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-23 15:36:21,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-23 15:36:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 15:36:21,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:21,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:36:21,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 15:36:21,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:21,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 351047532, now seen corresponding path program 1 times [2023-11-23 15:36:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455113283] [2023-11-23 15:36:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:21,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455113283] [2023-11-23 15:36:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455113283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:36:21,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:36:21,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 15:36:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780943539] [2023-11-23 15:36:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:36:21,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 15:36:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 15:36:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 15:36:21,729 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:21,767 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-11-23 15:36:21,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 15:36:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 15:36:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:21,769 INFO L225 Difference]: With dead ends: 28 [2023-11-23 15:36:21,769 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 15:36:21,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 15:36:21,770 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:21,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 15:36:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 15:36:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-23 15:36:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 15:36:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-11-23 15:36:21,777 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 9 [2023-11-23 15:36:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:21,777 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-11-23 15:36:21,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-11-23 15:36:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 15:36:21,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:21,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:36:21,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 15:36:21,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:21,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1072831909, now seen corresponding path program 1 times [2023-11-23 15:36:21,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:21,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499690919] [2023-11-23 15:36:21,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:22,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499690919] [2023-11-23 15:36:22,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499690919] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:36:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445452935] [2023-11-23 15:36:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:22,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:36:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:36:22,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:36:22,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 15:36:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:22,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-23 15:36:22,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:36:22,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 15:36:22,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-23 15:36:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:22,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:36:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445452935] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:36:22,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:36:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 26 [2023-11-23 15:36:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117789548] [2023-11-23 15:36:22,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:36:22,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 15:36:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 15:36:22,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2023-11-23 15:36:22,433 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:22,761 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2023-11-23 15:36:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 15:36:22,762 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 15:36:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:22,765 INFO L225 Difference]: With dead ends: 50 [2023-11-23 15:36:22,765 INFO L226 Difference]: Without dead ends: 50 [2023-11-23 15:36:22,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=1273, Unknown=0, NotChecked=0, Total=1482 [2023-11-23 15:36:22,766 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:22,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 154 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:36:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-23 15:36:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-11-23 15:36:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 37 states have internal predecessors, (38), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-23 15:36:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-23 15:36:22,779 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 17 [2023-11-23 15:36:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:22,780 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-23 15:36:22,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-23 15:36:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 15:36:22,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:22,781 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:36:22,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 15:36:22,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:36:22,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:22,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1052925719, now seen corresponding path program 2 times [2023-11-23 15:36:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003909580] [2023-11-23 15:36:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:36:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:23,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:36:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003909580] [2023-11-23 15:36:23,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003909580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:36:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690678970] [2023-11-23 15:36:23,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 15:36:23,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:36:23,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:36:23,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:36:23,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 15:36:23,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 15:36:23,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:36:23,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-23 15:36:23,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:36:23,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 15:36:23,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 15:36:23,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-23 15:36:23,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-23 15:36:24,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-23 15:36:24,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 15:36:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:24,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:36:38,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2023-11-23 15:36:38,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 15:36:38,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 957 treesize of output 959 [2023-11-23 15:36:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:36:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690678970] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:36:39,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:36:39,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 25] total 68 [2023-11-23 15:36:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534684895] [2023-11-23 15:36:39,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:36:39,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-23 15:36:39,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:36:39,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-23 15:36:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=4236, Unknown=6, NotChecked=0, Total=4556 [2023-11-23 15:36:39,492 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 47 states have internal predecessors, (74), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:43,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:36:46,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:36:49,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:36:53,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-23 15:36:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:36:56,364 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2023-11-23 15:36:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-23 15:36:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 47 states have internal predecessors, (74), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-23 15:36:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:36:56,365 INFO L225 Difference]: With dead ends: 84 [2023-11-23 15:36:56,365 INFO L226 Difference]: Without dead ends: 82 [2023-11-23 15:36:56,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=1062, Invalid=10488, Unknown=6, NotChecked=0, Total=11556 [2023-11-23 15:36:56,368 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 133 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 21 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-23 15:36:56,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 368 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1063 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2023-11-23 15:36:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-23 15:36:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2023-11-23 15:36:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 15 states have call successors, (15), 15 states have call predecessors, (15), 5 states have return successors, (17), 5 states have call predecessors, (17), 15 states have call successors, (17) [2023-11-23 15:36:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-11-23 15:36:56,373 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 33 [2023-11-23 15:36:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:36:56,373 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-11-23 15:36:56,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 47 states have internal predecessors, (74), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:36:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-11-23 15:36:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 15:36:56,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:36:56,375 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:36:56,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 15:36:56,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 15:36:56,587 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fooErr4ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:36:56,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:36:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash 976451067, now seen corresponding path program 3 times [2023-11-23 15:36:56,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:36:56,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265988415] [2023-11-23 15:36:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:36:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:36:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:37:00,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:37:00,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265988415] [2023-11-23 15:37:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265988415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:37:00,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116322256] [2023-11-23 15:37:00,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 15:37:00,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:37:00,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:37:00,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:37:00,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 15:37:00,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-23 15:37:00,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 15:37:00,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-23 15:37:00,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:37:01,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-23 15:37:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-11-23 15:37:02,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:37:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-11-23 15:37:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116322256] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:37:04,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:37:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 13, 13] total 56 [2023-11-23 15:37:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828918779] [2023-11-23 15:37:04,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:37:04,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-23 15:37:04,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:37:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-23 15:37:04,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=2771, Unknown=0, NotChecked=0, Total=3080 [2023-11-23 15:37:04,216 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 56 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:37:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:37:10,481 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-11-23 15:37:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-11-23 15:37:10,482 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2023-11-23 15:37:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:37:10,483 INFO L225 Difference]: With dead ends: 86 [2023-11-23 15:37:10,483 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 15:37:10,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1112, Invalid=7630, Unknown=0, NotChecked=0, Total=8742 [2023-11-23 15:37:10,486 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 135 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-23 15:37:10,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 330 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-23 15:37:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 15:37:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-11-23 15:37:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 17 states have call successors, (17), 17 states have call predecessors, (17), 5 states have return successors, (19), 5 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-23 15:37:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2023-11-23 15:37:10,490 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 65 [2023-11-23 15:37:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:37:10,490 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2023-11-23 15:37:10,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 39 states have internal predecessors, (73), 18 states have call successors, (20), 18 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:37:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2023-11-23 15:37:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-23 15:37:10,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:37:10,493 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:37:10,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 15:37:10,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:37:10,704 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:37:10,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:37:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1069249261, now seen corresponding path program 1 times [2023-11-23 15:37:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:37:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592600356] [2023-11-23 15:37:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:37:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:37:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 15:37:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:12,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:15,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:16,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:17,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:37:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 22 proven. 128 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2023-11-23 15:37:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:37:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592600356] [2023-11-23 15:37:18,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592600356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 15:37:18,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014546743] [2023-11-23 15:37:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:37:18,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:37:18,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 15:37:18,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 15:37:18,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 15:37:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:37:18,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 209 conjunts are in the unsatisfiable core [2023-11-23 15:37:18,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 15:37:18,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 15:37:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-11-23 15:37:22,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 15:38:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 15:38:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014546743] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 15:38:28,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 15:38:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 71] total 104 [2023-11-23 15:38:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235581841] [2023-11-23 15:38:28,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 15:38:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-11-23 15:38:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:38:28,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-11-23 15:38:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=9398, Unknown=0, NotChecked=0, Total=10712 [2023-11-23 15:38:28,090 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 86 states have internal predecessors, (112), 23 states have call successors, (23), 18 states have call predecessors, (23), 36 states have return successors, (51), 35 states have call predecessors, (51), 23 states have call successors, (51) [2023-11-23 15:38:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:38:31,133 INFO L93 Difference]: Finished difference Result 123 states and 212 transitions. [2023-11-23 15:38:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 15:38:31,134 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 86 states have internal predecessors, (112), 23 states have call successors, (23), 18 states have call predecessors, (23), 36 states have return successors, (51), 35 states have call predecessors, (51), 23 states have call successors, (51) Word has length 108 [2023-11-23 15:38:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:38:31,138 INFO L225 Difference]: With dead ends: 123 [2023-11-23 15:38:31,139 INFO L226 Difference]: Without dead ends: 119 [2023-11-23 15:38:31,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 169 SyntacticMatches, 15 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7113 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1692, Invalid=11190, Unknown=0, NotChecked=0, Total=12882 [2023-11-23 15:38:31,142 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-23 15:38:31,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 319 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-23 15:38:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-23 15:38:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2023-11-23 15:38:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 17 states have call successors, (17), 17 states have call predecessors, (17), 21 states have return successors, (77), 21 states have call predecessors, (77), 17 states have call successors, (77) [2023-11-23 15:38:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2023-11-23 15:38:31,151 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 108 [2023-11-23 15:38:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:38:31,151 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2023-11-23 15:38:31,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 86 states have internal predecessors, (112), 23 states have call successors, (23), 18 states have call predecessors, (23), 36 states have return successors, (51), 35 states have call predecessors, (51), 23 states have call successors, (51) [2023-11-23 15:38:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2023-11-23 15:38:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-23 15:38:31,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 15:38:31,162 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:38:31,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 15:38:31,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 15:38:31,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-23 15:38:31,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 15:38:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1173622471, now seen corresponding path program 2 times [2023-11-23 15:38:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 15:38:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87525494] [2023-11-23 15:38:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 15:38:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 15:38:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 15:38:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-23 15:38:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 15:38:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2023-11-23 15:38:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 15:38:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87525494] [2023-11-23 15:38:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87525494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 15:38:31,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 15:38:31,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 15:38:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603141958] [2023-11-23 15:38:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 15:38:31,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 15:38:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 15:38:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 15:38:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:38:31,748 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:38:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 15:38:31,837 INFO L93 Difference]: Finished difference Result 116 states and 172 transitions. [2023-11-23 15:38:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 15:38:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 132 [2023-11-23 15:38:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 15:38:31,838 INFO L225 Difference]: With dead ends: 116 [2023-11-23 15:38:31,838 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 15:38:31,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 15:38:31,839 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 15:38:31,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 15:38:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 15:38:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 15:38:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 15:38:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 15:38:31,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2023-11-23 15:38:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 15:38:31,839 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 15:38:31,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 15:38:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 15:38:31,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 15:38:31,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fooErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fooErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fooErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fooErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fooErr4ASSERT_VIOLATIONMEMORY_LEAK (7 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location plusErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location plusErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location plusErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 12 remaining) [2023-11-23 15:38:31,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location plusErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 12 remaining) [2023-11-23 15:38:31,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 15:38:31,846 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 15:38:31,847 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 15:38:31,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:38:31 BoogieIcfgContainer [2023-11-23 15:38:31,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 15:38:31,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 15:38:31,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 15:38:31,852 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 15:38:31,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:20" (3/4) ... [2023-11-23 15:38:31,854 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 15:38:31,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2023-11-23 15:38:31,857 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2023-11-23 15:38:31,860 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2023-11-23 15:38:31,861 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-23 15:38:31,861 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 15:38:31,861 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-23 15:38:31,861 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 15:38:31,929 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 15:38:31,929 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 15:38:31,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 15:38:31,930 INFO L158 Benchmark]: Toolchain (without parser) took 132120.98ms. Allocated memory was 197.1MB in the beginning and 486.5MB in the end (delta: 289.4MB). Free memory was 129.1MB in the beginning and 295.9MB in the end (delta: -166.8MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2023-11-23 15:38:31,930 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 15:38:31,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.44ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 119.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 15:38:31,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.24ms. Allocated memory is still 197.1MB. Free memory was 119.0MB in the beginning and 117.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 15:38:31,931 INFO L158 Benchmark]: Boogie Preprocessor took 13.29ms. Allocated memory is still 197.1MB. Free memory was 117.5MB in the beginning and 116.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 15:38:31,933 INFO L158 Benchmark]: RCFGBuilder took 363.35ms. Allocated memory is still 197.1MB. Free memory was 116.4MB in the beginning and 157.1MB in the end (delta: -40.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2023-11-23 15:38:31,934 INFO L158 Benchmark]: TraceAbstraction took 131477.92ms. Allocated memory was 197.1MB in the beginning and 486.5MB in the end (delta: 289.4MB). Free memory was 156.6MB in the beginning and 300.1MB in the end (delta: -143.5MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. [2023-11-23 15:38:31,935 INFO L158 Benchmark]: Witness Printer took 77.67ms. Allocated memory is still 486.5MB. Free memory was 300.1MB in the beginning and 295.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 15:38:31,937 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.44ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 119.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.24ms. Allocated memory is still 197.1MB. Free memory was 119.0MB in the beginning and 117.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.29ms. Allocated memory is still 197.1MB. Free memory was 117.5MB in the beginning and 116.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.35ms. Allocated memory is still 197.1MB. Free memory was 116.4MB in the beginning and 157.1MB in the end (delta: -40.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * TraceAbstraction took 131477.92ms. Allocated memory was 197.1MB in the beginning and 486.5MB in the end (delta: 289.4MB). Free memory was 156.6MB in the beginning and 300.1MB in the end (delta: -143.5MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. * Witness Printer took 77.67ms. Allocated memory is still 486.5MB. Free memory was 300.1MB in the beginning and 295.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 131.4s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 1526 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1322 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2763 IncrementalHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 204 mSDtfsCounter, 2763 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 773 GetRequests, 371 SyntacticMatches, 22 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12247 ImplicationChecksByTransitivity, 46.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=11, InterpolantAutomatonStates: 203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 11 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 102.7s InterpolantComputationTime, 619 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 822 ConstructedInterpolants, 27 QuantifiedInterpolants, 7707 SizeOfPredicates, 96 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 375 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 1462/2393 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-23 15:38:32,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE