./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5dc0e184171498e703ccf08545f4f79d3c1c383c8c0fc13a1f35990befb669a4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:27:35,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:27:35,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:27:35,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:27:35,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:27:36,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:27:36,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:27:36,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:27:36,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:27:36,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:27:36,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:27:36,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:27:36,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:27:36,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:27:36,011 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:27:36,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:27:36,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:27:36,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:27:36,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:27:36,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:27:36,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:27:36,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:27:36,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:27:36,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:27:36,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:27:36,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:27:36,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:27:36,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:27:36,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:27:36,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:27:36,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:27:36,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:27:36,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:27:36,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:27:36,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:27:36,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:27:36,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:27:36,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:27:36,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:27:36,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:27:36,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:27:36,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:27:36,023 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 ! call(reach_error())) ) 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 -> 5dc0e184171498e703ccf08545f4f79d3c1c383c8c0fc13a1f35990befb669a4 [2024-11-11 19:27:36,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:27:36,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:27:36,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:27:36,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:27:36,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:27:36,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2024-11-11 19:27:37,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:27:38,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:27:38,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2024-11-11 19:27:38,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f3d8388/7c6cc9b0e8754a7aa6d63c36bfd058b9/FLAGa9ace562c [2024-11-11 19:27:38,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f3d8388/7c6cc9b0e8754a7aa6d63c36bfd058b9 [2024-11-11 19:27:38,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:27:38,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:27:38,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:27:38,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:27:38,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:27:38,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18093d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38, skipping insertion in model container [2024-11-11 19:27:38,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:27:38,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i[296,309] [2024-11-11 19:27:38,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:27:38,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:27:38,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i[296,309] [2024-11-11 19:27:38,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:27:38,857 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:27:38,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38 WrapperNode [2024-11-11 19:27:38,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:27:38,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:27:38,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:27:38,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:27:38,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,896 INFO L138 Inliner]: procedures = 126, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2024-11-11 19:27:38,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:27:38,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:27:38,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:27:38,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:27:38,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,920 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 0, 2]. 50 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 0 writes are split as follows [0, 0, 0]. [2024-11-11 19:27:38,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:27:38,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:27:38,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:27:38,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:27:38,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (1/1) ... [2024-11-11 19:27:38,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:27:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:38,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:27:38,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:27:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2024-11-11 19:27:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2024-11-11 19:27:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:27:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-11 19:27:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-11 19:27:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 19:27:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 19:27:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-11 19:27:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2024-11-11 19:27:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2024-11-11 19:27:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:27:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:27:39,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 19:27:39,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:27:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:27:39,116 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:27:39,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:27:39,255 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-11 19:27:39,256 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:27:39,270 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:27:39,271 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 19:27:39,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:27:39 BoogieIcfgContainer [2024-11-11 19:27:39,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:27:39,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:27:39,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:27:39,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:27:39,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:27:38" (1/3) ... [2024-11-11 19:27:39,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc892f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:27:39, skipping insertion in model container [2024-11-11 19:27:39,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:27:38" (2/3) ... [2024-11-11 19:27:39,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc892f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:27:39, skipping insertion in model container [2024-11-11 19:27:39,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:27:39" (3/3) ... [2024-11-11 19:27:39,279 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2024-11-11 19:27:39,291 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:27:39,291 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:27:39,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:27:39,344 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@63fb4f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:27:39,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:27:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-11 19:27:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 19:27:39,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:39,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:39,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:39,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash 484842023, now seen corresponding path program 1 times [2024-11-11 19:27:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162074371] [2024-11-11 19:27:39,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:27:39,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:39,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162074371] [2024-11-11 19:27:39,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162074371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:27:39,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:27:39,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:27:39,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921846094] [2024-11-11 19:27:39,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:27:39,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:27:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:27:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:27:39,750 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-11 19:27:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:39,821 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2024-11-11 19:27:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:27:39,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-11-11 19:27:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:39,832 INFO L225 Difference]: With dead ends: 68 [2024-11-11 19:27:39,833 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:27:39,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:27:39,841 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:39,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:27:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:27:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 19:27:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 19:27:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-11 19:27:39,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 7 [2024-11-11 19:27:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:39,883 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-11 19:27:39,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-11 19:27:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-11 19:27:39,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 19:27:39,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:39,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:27:39,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:39,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1134155612, now seen corresponding path program 1 times [2024-11-11 19:27:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406889756] [2024-11-11 19:27:39,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:27:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406889756] [2024-11-11 19:27:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406889756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:27:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359403012] [2024-11-11 19:27:40,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:40,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:40,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:40,274 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) [2024-11-11 19:27:40,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:27:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:40,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 19:27:40,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:27:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:27:40,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:27:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:27:40,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359403012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:27:40,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:27:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-11 19:27:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815614330] [2024-11-11 19:27:40,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:27:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:27:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:27:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:27:40,601 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:27:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:40,713 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-11 19:27:40,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:27:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-11 19:27:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:40,716 INFO L225 Difference]: With dead ends: 53 [2024-11-11 19:27:40,716 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 19:27:40,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:27:40,718 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:40,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:27:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 19:27:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 19:27:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-11 19:27:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-11 19:27:40,726 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 26 [2024-11-11 19:27:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:40,727 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-11 19:27:40,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:27:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-11 19:27:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 19:27:40,728 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:40,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:40,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:27:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:40,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1951804062, now seen corresponding path program 1 times [2024-11-11 19:27:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026762085] [2024-11-11 19:27:40,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:27:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026762085] [2024-11-11 19:27:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026762085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:27:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:27:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:27:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721706746] [2024-11-11 19:27:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:27:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:27:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:41,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:27:41,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:27:41,136 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:27:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:41,236 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-11 19:27:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:27:41,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-11 19:27:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:41,241 INFO L225 Difference]: With dead ends: 51 [2024-11-11 19:27:41,241 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:27:41,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:27:41,243 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:41,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:27:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:27:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 19:27:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-11 19:27:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-11 19:27:41,253 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 26 [2024-11-11 19:27:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:41,253 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-11 19:27:41,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:27:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-11 19:27:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 19:27:41,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:41,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:41,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:27:41,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:41,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1250739484, now seen corresponding path program 1 times [2024-11-11 19:27:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752145956] [2024-11-11 19:27:41,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:27:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:41,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752145956] [2024-11-11 19:27:41,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752145956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:27:41,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503380462] [2024-11-11 19:27:41,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:41,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:41,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:41,519 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) [2024-11-11 19:27:41,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:27:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:41,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 19:27:41,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:27:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:27:41,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:27:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503380462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:27:41,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:27:41,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2024-11-11 19:27:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349806904] [2024-11-11 19:27:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:27:41,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 19:27:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 19:27:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2024-11-11 19:27:41,905 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:27:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:42,278 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-11 19:27:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 19:27:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-11 19:27:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:42,282 INFO L225 Difference]: With dead ends: 57 [2024-11-11 19:27:42,282 INFO L226 Difference]: Without dead ends: 54 [2024-11-11 19:27:42,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-11-11 19:27:42,283 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:42,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 120 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:27:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-11 19:27:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2024-11-11 19:27:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-11 19:27:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-11 19:27:42,302 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 26 [2024-11-11 19:27:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:42,302 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-11 19:27:42,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:27:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-11 19:27:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:27:42,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:42,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:42,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:27:42,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-11 19:27:42,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:42,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:42,511 INFO L85 PathProgramCache]: Analyzing trace with hash 937918941, now seen corresponding path program 1 times [2024-11-11 19:27:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:42,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067165421] [2024-11-11 19:27:42,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:42,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:42,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:42,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 19:27:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:27:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067165421] [2024-11-11 19:27:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067165421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:27:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382267861] [2024-11-11 19:27:42,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:42,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:42,890 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) [2024-11-11 19:27:42,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:27:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:42,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 19:27:42,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:27:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:27:43,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:27:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:27:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382267861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:27:43,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:27:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 25 [2024-11-11 19:27:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146836767] [2024-11-11 19:27:43,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:27:43,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 19:27:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 19:27:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-11-11 19:27:43,520 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 25 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 19 states have internal predecessors, (39), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 19:27:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:44,109 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-11-11 19:27:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 19:27:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 19 states have internal predecessors, (39), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-11-11 19:27:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:44,112 INFO L225 Difference]: With dead ends: 64 [2024-11-11 19:27:44,112 INFO L226 Difference]: Without dead ends: 60 [2024-11-11 19:27:44,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 19:27:44,114 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:44,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 87 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:27:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-11 19:27:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-11 19:27:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-11 19:27:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-11-11 19:27:44,137 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 33 [2024-11-11 19:27:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-11-11 19:27:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 19 states have internal predecessors, (39), 5 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 19:27:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-11-11 19:27:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:27:44,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:44,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:44,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:27:44,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:44,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:44,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 128572315, now seen corresponding path program 1 times [2024-11-11 19:27:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637907390] [2024-11-11 19:27:44,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:44,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 19:27:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:27:44,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:44,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637907390] [2024-11-11 19:27:44,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637907390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:27:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801739123] [2024-11-11 19:27:44,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:44,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:44,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:44,616 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) [2024-11-11 19:27:44,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:27:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:44,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 19:27:44,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:27:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:27:44,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:27:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:27:45,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801739123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:27:45,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:27:45,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2024-11-11 19:27:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675875933] [2024-11-11 19:27:45,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:27:45,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-11 19:27:45,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:45,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-11 19:27:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 19:27:45,306 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 26 states have internal predecessors, (63), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-11 19:27:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:45,908 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2024-11-11 19:27:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 19:27:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 26 states have internal predecessors, (63), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 33 [2024-11-11 19:27:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:45,910 INFO L225 Difference]: With dead ends: 78 [2024-11-11 19:27:45,910 INFO L226 Difference]: Without dead ends: 68 [2024-11-11 19:27:45,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2024-11-11 19:27:45,912 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 134 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:45,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 127 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:27:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-11 19:27:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2024-11-11 19:27:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-11 19:27:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-11-11 19:27:45,919 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 33 [2024-11-11 19:27:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:45,919 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-11-11 19:27:45,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 26 states have internal predecessors, (63), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-11 19:27:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-11 19:27:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 19:27:45,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:45,921 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:45,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:27:46,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:46,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:46,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1975182920, now seen corresponding path program 1 times [2024-11-11 19:27:46,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:46,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778189955] [2024-11-11 19:27:46,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 19:27:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 19:27:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 19:27:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778189955] [2024-11-11 19:27:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778189955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:27:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913853878] [2024-11-11 19:27:46,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:46,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:46,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:46,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:27:46,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:27:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:46,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 19:27:46,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:27:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:27:46,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:27:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:27:47,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913853878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:27:47,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:27:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 28 [2024-11-11 19:27:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267026361] [2024-11-11 19:27:47,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:27:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 19:27:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:47,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 19:27:47,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2024-11-11 19:27:47,066 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 28 states, 27 states have (on average 1.962962962962963) internal successors, (53), 21 states have internal predecessors, (53), 8 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-11 19:27:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:47,848 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-11 19:27:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 19:27:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.962962962962963) internal successors, (53), 21 states have internal predecessors, (53), 8 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 43 [2024-11-11 19:27:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:47,850 INFO L225 Difference]: With dead ends: 85 [2024-11-11 19:27:47,850 INFO L226 Difference]: Without dead ends: 67 [2024-11-11 19:27:47,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=1843, Unknown=0, NotChecked=0, Total=2070 [2024-11-11 19:27:47,851 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:47,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 124 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:27:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-11 19:27:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-11 19:27:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 19:27:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-11 19:27:47,862 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 43 [2024-11-11 19:27:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:47,862 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-11 19:27:47,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.962962962962963) internal successors, (53), 21 states have internal predecessors, (53), 8 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-11 19:27:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-11 19:27:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 19:27:47,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:47,864 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:47,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:27:48,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:48,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:48,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash -544777014, now seen corresponding path program 1 times [2024-11-11 19:27:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067110645] [2024-11-11 19:27:48,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 19:27:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 19:27:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:27:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067110645] [2024-11-11 19:27:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067110645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:27:48,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807506797] [2024-11-11 19:27:48,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:48,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:48,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:48,378 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:27:48,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:27:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:48,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 19:27:48,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:27:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:27:48,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:27:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:27:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807506797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:27:48,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:27:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 25 [2024-11-11 19:27:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945294647] [2024-11-11 19:27:48,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:27:48,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 19:27:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 19:27:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-11-11 19:27:48,870 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 20 states have internal predecessors, (48), 5 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:27:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:49,287 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-11-11 19:27:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 19:27:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 20 states have internal predecessors, (48), 5 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2024-11-11 19:27:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:49,288 INFO L225 Difference]: With dead ends: 67 [2024-11-11 19:27:49,288 INFO L226 Difference]: Without dead ends: 64 [2024-11-11 19:27:49,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 19:27:49,289 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 59 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:49,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 121 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:27:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-11 19:27:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2024-11-11 19:27:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-11 19:27:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-11 19:27:49,297 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 43 [2024-11-11 19:27:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:49,297 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-11 19:27:49,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 20 states have internal predecessors, (48), 5 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:27:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-11 19:27:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 19:27:49,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:49,299 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:49,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:27:49,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:49,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:49,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 156287564, now seen corresponding path program 1 times [2024-11-11 19:27:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972391584] [2024-11-11 19:27:49,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 19:27:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:49,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 19:27:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 19:27:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 19:27:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 19:27:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:27:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972391584] [2024-11-11 19:27:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972391584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:27:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756840696] [2024-11-11 19:27:49,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:49,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:49,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:27:49,655 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:27:49,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:27:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:27:49,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-11 19:27:49,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:27:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:27:49,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:27:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:27:49,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756840696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:27:49,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:27:49,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 16 [2024-11-11 19:27:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405054402] [2024-11-11 19:27:49,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:27:49,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 19:27:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:27:49,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 19:27:49,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:27:49,904 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:27:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:27:50,107 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-11-11 19:27:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 19:27:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2024-11-11 19:27:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:27:50,109 INFO L225 Difference]: With dead ends: 60 [2024-11-11 19:27:50,109 INFO L226 Difference]: Without dead ends: 53 [2024-11-11 19:27:50,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-11-11 19:27:50,110 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:27:50,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 102 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:27:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-11 19:27:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-11 19:27:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-11 19:27:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-11 19:27:50,118 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 43 [2024-11-11 19:27:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:27:50,118 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-11 19:27:50,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:27:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-11 19:27:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 19:27:50,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:27:50,119 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:50,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 19:27:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:27:50,324 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:27:50,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:27:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2126992523, now seen corresponding path program 1 times [2024-11-11 19:27:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:27:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163596516] [2024-11-11 19:27:50,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:27:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:27:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:27:50,338 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 19:27:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 19:27:50,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 19:27:50,372 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 19:27:50,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:27:50,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 19:27:50,378 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:27:50,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:27:50,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:27:50 BoogieIcfgContainer [2024-11-11 19:27:50,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:27:50,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:27:50,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:27:50,457 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:27:50,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:27:39" (3/4) ... [2024-11-11 19:27:50,458 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 19:27:50,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:27:50,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:27:50,532 INFO L158 Benchmark]: Toolchain (without parser) took 12123.65ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 128.6MB in the beginning and 73.7MB in the end (delta: 54.8MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2024-11-11 19:27:50,533 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:27:50,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.33ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 108.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 19:27:50,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.65ms. Allocated memory is still 159.4MB. Free memory was 108.9MB in the beginning and 106.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:27:50,537 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 159.4MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:27:50,537 INFO L158 Benchmark]: RCFGBuilder took 339.85ms. Allocated memory is still 159.4MB. Free memory was 104.8MB in the beginning and 90.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 19:27:50,537 INFO L158 Benchmark]: TraceAbstraction took 11182.17ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 90.2MB in the beginning and 77.9MB in the end (delta: 12.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-11 19:27:50,537 INFO L158 Benchmark]: Witness Printer took 75.90ms. Allocated memory is still 195.0MB. Free memory was 77.9MB in the beginning and 73.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:27:50,539 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.65ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.33ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 108.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.65ms. Allocated memory is still 159.4MB. Free memory was 108.9MB in the beginning and 106.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 159.4MB. Free memory was 106.9MB in the beginning and 104.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 339.85ms. Allocated memory is still 159.4MB. Free memory was 104.8MB in the beginning and 90.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11182.17ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 90.2MB in the beginning and 77.9MB in the end (delta: 12.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 75.90ms. Allocated memory is still 195.0MB. Free memory was 77.9MB in the beginning and 73.7MB 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 - CounterExampleResult [Line: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L519] void * guard_malloc_counter = 0; [L534] struct list_head *elem = ((void *)0); [L544] static struct list_head head; [L544] static struct list_head head; [L544] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L546] struct list_head *dev1, *dev2; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L547] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L547] RET, EXPR my_malloc(sizeof(*dev1)) VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L547] dev1 = my_malloc(sizeof(*dev1)) [L548] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L548] RET, EXPR my_malloc(sizeof(*dev2)) VAL [dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L548] dev2 = my_malloc(sizeof(*dev2)) [L549] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L550] CALL list_add(dev2, &head) VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}, new={0:2}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L550] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L551] CALL list_add(dev1, &head) VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}, new={0:1}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L551] RET list_add(dev1, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L552] CALL list_del(dev2) [L541] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L552] RET list_del(dev2) [L553] CALL list_add(dev2, &head) VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, new={0:2}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L553] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L554] CALL list_add(dev1, &head) VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, new={0:1}] [L536] CALL __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L6] reach_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 837 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3700 IncrementalHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 182 mSDtfsCounter, 3700 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 406 SyntacticMatches, 45 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=7, InterpolantAutomatonStates: 109, 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, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 2509 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1439 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 154/249 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-11 19:27:50,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE