./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.fs.cvc5-61a6796-m [2024-10-14 01:43:27,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:43:27,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:43:27,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:43:27,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:43:28,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:43:28,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:43:28,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:43:28,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:43:28,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:43:28,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:43:28,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:43:28,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:43:28,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:43:28,028 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:43:28,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:43:28,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:43:28,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:43:28,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:43:28,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:43:28,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:43:28,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:43:28,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:43:28,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:43:28,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:43:28,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:43:28,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:43:28,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:43:28,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:43:28,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:43:28,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:43:28,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:43:28,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:43:28,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:43:28,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:43:28,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:43:28,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:43:28,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:43:28,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:43:28,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:43:28,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:43:28,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:43:28,042 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-10-14 01:43:28,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:43:28,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:43:28,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:43:28,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:43:28,359 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:43:28,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2024-10-14 01:43:29,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:43:30,054 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:43:30,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2024-10-14 01:43:30,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f0eaade/9ce80d3710d9437e88fd90cbf5d424f7/FLAG4113edc54 [2024-10-14 01:43:30,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f0eaade/9ce80d3710d9437e88fd90cbf5d424f7 [2024-10-14 01:43:30,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:43:30,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:43:30,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:43:30,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:43:30,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:43:30,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c56f32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30, skipping insertion in model container [2024-10-14 01:43:30,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:43:30,613 WARN L248 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-10-14 01:43:30,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:43:30,756 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:43:30,770 WARN L248 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-10-14 01:43:30,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:43:30,851 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:43:30,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30 WrapperNode [2024-10-14 01:43:30,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:43:30,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:43:30,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:43:30,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:43:30,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,890 INFO L138 Inliner]: procedures = 126, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2024-10-14 01:43:30,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:43:30,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:43:30,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:43:30,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:43:30,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,919 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-10-14 01:43:30,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:43:30,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:43:30,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:43:30,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:43:30,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (1/1) ... [2024-10-14 01:43:30,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:43:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:30,978 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-10-14 01:43:30,983 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-10-14 01:43:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2024-10-14 01:43:31,061 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2024-10-14 01:43:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:43:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-14 01:43:31,062 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2024-10-14 01:43:31,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:43:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:43:31,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:43:31,250 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:43:31,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:43:31,442 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 01:43:31,442 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:43:31,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:43:31,478 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 01:43:31,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:31 BoogieIcfgContainer [2024-10-14 01:43:31,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:43:31,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:43:31,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:43:31,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:43:31,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:43:30" (1/3) ... [2024-10-14 01:43:31,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631df341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:31, skipping insertion in model container [2024-10-14 01:43:31,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:30" (2/3) ... [2024-10-14 01:43:31,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631df341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:31, skipping insertion in model container [2024-10-14 01:43:31,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:31" (3/3) ... [2024-10-14 01:43:31,493 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2024-10-14 01:43:31,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:43:31,511 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:43:31,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:43:31,590 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;@7fe7fc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:43:31,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:43:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 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-10-14 01:43:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 01:43:31,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:31,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 01:43:31,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:31,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash -938885129, now seen corresponding path program 1 times [2024-10-14 01:43:31,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:31,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387707276] [2024-10-14 01:43:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:43:31,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:31,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387707276] [2024-10-14 01:43:31,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387707276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:43:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017656704] [2024-10-14 01:43:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:31,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:43:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:43:31,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:43:31,919 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-14 01:43:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:31,994 INFO L93 Difference]: Finished difference Result 60 states and 85 transitions. [2024-10-14 01:43:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:43:31,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 6 [2024-10-14 01:43:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:32,001 INFO L225 Difference]: With dead ends: 60 [2024-10-14 01:43:32,002 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:43:32,005 INFO L431 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-10-14 01:43:32,008 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:32,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:43:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:43:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 01:43:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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-10-14 01:43:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-14 01:43:32,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 6 [2024-10-14 01:43:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:32,042 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-14 01:43:32,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-14 01:43:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-14 01:43:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:43:32,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:32,044 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:32,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:43:32,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:32,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1815646752, now seen corresponding path program 1 times [2024-10-14 01:43:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:32,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726623850] [2024-10-14 01:43:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:32,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:32,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:43:32,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:32,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726623850] [2024-10-14 01:43:32,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726623850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:32,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037123346] [2024-10-14 01:43:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:32,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:32,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:32,423 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-10-14 01:43:32,425 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-10-14 01:43:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:32,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 01:43:32,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:43:32,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:43:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:43:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037123346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:43:32,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:43:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-14 01:43:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891555550] [2024-10-14 01:43:32,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:43:32,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:43:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:32,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:43:32,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:43:32,754 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-10-14 01:43:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:32,877 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-10-14 01:43:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 01:43:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 23 [2024-10-14 01:43:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:32,880 INFO L225 Difference]: With dead ends: 50 [2024-10-14 01:43:32,881 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 01:43:32,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:43:32,883 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:32,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:43:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 01:43:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 01:43:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-10-14 01:43:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-14 01:43:32,898 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 23 [2024-10-14 01:43:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:32,899 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-14 01:43:32,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-10-14 01:43:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-14 01:43:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:43:32,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:32,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:32,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:43:33,102 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-10-14 01:43:33,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:33,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:33,104 INFO L85 PathProgramCache]: Analyzing trace with hash -178497954, now seen corresponding path program 1 times [2024-10-14 01:43:33,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:33,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23174183] [2024-10-14 01:43:33,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:33,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:43:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23174183] [2024-10-14 01:43:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23174183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 01:43:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233881931] [2024-10-14 01:43:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:43:33,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:33,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:43:33,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:43:33,327 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-14 01:43:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:33,435 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-10-14 01:43:33,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 01:43:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 23 [2024-10-14 01:43:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:33,436 INFO L225 Difference]: With dead ends: 48 [2024-10-14 01:43:33,437 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:43:33,437 INFO L431 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-10-14 01:43:33,438 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:33,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:43:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:43:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 01:43:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-10-14 01:43:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-14 01:43:33,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 23 [2024-10-14 01:43:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:33,446 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-14 01:43:33,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-14 01:43:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-14 01:43:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:43:33,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:33,448 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:33,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:43:33,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash -571524964, now seen corresponding path program 1 times [2024-10-14 01:43:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278969451] [2024-10-14 01:43:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:43:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278969451] [2024-10-14 01:43:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278969451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39701443] [2024-10-14 01:43:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:33,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:33,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:33,790 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-10-14 01:43:33,791 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-10-14 01:43:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:33,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 01:43:33,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 01:43:34,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:43:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39701443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:34,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 01:43:34,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2024-10-14 01:43:34,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281494316] [2024-10-14 01:43:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:34,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 01:43:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 01:43:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2024-10-14 01:43:34,293 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-10-14 01:43:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:34,668 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-10-14 01:43:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:43:34,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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 23 [2024-10-14 01:43:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:34,671 INFO L225 Difference]: With dead ends: 55 [2024-10-14 01:43:34,671 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 01:43:34,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2024-10-14 01:43:34,673 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:34,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 114 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:43:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 01:43:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-10-14 01:43:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 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-10-14 01:43:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-10-14 01:43:34,684 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2024-10-14 01:43:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:34,684 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-10-14 01:43:34,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-10-14 01:43:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-10-14 01:43:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 01:43:34,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:34,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:34,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 01:43:34,887 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-10-14 01:43:34,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:34,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash -767744731, now seen corresponding path program 1 times [2024-10-14 01:43:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139825573] [2024-10-14 01:43:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 01:43:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:43:35,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139825573] [2024-10-14 01:43:35,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139825573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783969439] [2024-10-14 01:43:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:35,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:35,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:35,251 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-10-14 01:43:35,252 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-10-14 01:43:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:35,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 01:43:35,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:43:35,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:43:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:43:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783969439] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:43:35,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:43:35,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 25 [2024-10-14 01:43:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538173358] [2024-10-14 01:43:35,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:43:35,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 01:43:35,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 01:43:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-10-14 01:43:35,842 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 25 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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-10-14 01:43:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:36,459 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-10-14 01:43:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 01:43:36,460 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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 30 [2024-10-14 01:43:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:36,461 INFO L225 Difference]: With dead ends: 62 [2024-10-14 01:43:36,461 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 01:43:36,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 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-10-14 01:43:36,465 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:36,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 74 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:43:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 01:43:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 01:43:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 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-10-14 01:43:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-10-14 01:43:36,482 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 30 [2024-10-14 01:43:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:36,483 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-10-14 01:43:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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-10-14 01:43:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-10-14 01:43:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 01:43:36,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:36,484 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:36,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:43:36,684 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-10-14 01:43:36,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:36,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:36,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1577091357, now seen corresponding path program 1 times [2024-10-14 01:43:36,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437972230] [2024-10-14 01:43:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:36,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 01:43:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:43:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437972230] [2024-10-14 01:43:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437972230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:36,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816978995] [2024-10-14 01:43:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:36,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:36,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:36,953 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-10-14 01:43:36,954 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-10-14 01:43:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:37,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 01:43:37,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:43:37,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:43:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:43:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816978995] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:43:37,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:43:37,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2024-10-14 01:43:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849930448] [2024-10-14 01:43:37,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:43:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 01:43:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 01:43:37,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 01:43:37,638 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 34 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 26 states have internal predecessors, (55), 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-10-14 01:43:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:38,301 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-10-14 01:43:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 01:43:38,302 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 26 states have internal predecessors, (55), 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 30 [2024-10-14 01:43:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:38,303 INFO L225 Difference]: With dead ends: 76 [2024-10-14 01:43:38,303 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 01:43:38,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2024-10-14 01:43:38,304 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 127 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:38,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 107 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:43:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 01:43:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2024-10-14 01:43:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 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-10-14 01:43:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-10-14 01:43:38,317 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 30 [2024-10-14 01:43:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:38,319 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-10-14 01:43:38,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 26 states have internal predecessors, (55), 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-10-14 01:43:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-10-14 01:43:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 01:43:38,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:38,321 INFO L215 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] [2024-10-14 01:43:38,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:43:38,521 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-10-14 01:43:38,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:38,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1743982480, now seen corresponding path program 1 times [2024-10-14 01:43:38,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:38,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203756823] [2024-10-14 01:43:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:38,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:38,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:38,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 01:43:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 01:43:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 01:43:38,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203756823] [2024-10-14 01:43:38,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203756823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:38,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171600662] [2024-10-14 01:43:38,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:38,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:38,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:38,815 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-10-14 01:43:38,817 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-10-14 01:43:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:38,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 01:43:38,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:43:39,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:43:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:43:39,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171600662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:43:39,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:43:39,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 28 [2024-10-14 01:43:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92867924] [2024-10-14 01:43:39,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:43:39,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 01:43:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 01:43:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2024-10-14 01:43:39,519 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 28 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 21 states have internal predecessors, (47), 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-10-14 01:43:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:40,253 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2024-10-14 01:43:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 01:43:40,253 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 21 states have internal predecessors, (47), 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 40 [2024-10-14 01:43:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:40,254 INFO L225 Difference]: With dead ends: 83 [2024-10-14 01:43:40,254 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 01:43:40,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 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-10-14 01:43:40,256 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 102 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:40,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 87 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:43:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 01:43:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-10-14 01:43:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 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-10-14 01:43:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-10-14 01:43:40,265 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 40 [2024-10-14 01:43:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:40,266 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-10-14 01:43:40,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 21 states have internal predecessors, (47), 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-10-14 01:43:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-10-14 01:43:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 01:43:40,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:40,270 INFO L215 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] [2024-10-14 01:43:40,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 01:43:40,470 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-10-14 01:43:40,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:40,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:40,471 INFO L85 PathProgramCache]: Analyzing trace with hash -775977454, now seen corresponding path program 1 times [2024-10-14 01:43:40,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:40,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087285387] [2024-10-14 01:43:40,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:40,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:40,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 01:43:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:40,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 01:43:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:43:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087285387] [2024-10-14 01:43:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087285387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506950610] [2024-10-14 01:43:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:40,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:40,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:40,847 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-10-14 01:43:40,848 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-10-14 01:43:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:40,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 01:43:40,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:43:41,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:43:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:43:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506950610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:43:41,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:43:41,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 25 [2024-10-14 01:43:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958433786] [2024-10-14 01:43:41,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:43:41,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 01:43:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 01:43:41,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-10-14 01:43:41,339 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 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-10-14 01:43:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:41,817 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-14 01:43:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 01:43:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 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 40 [2024-10-14 01:43:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:41,819 INFO L225 Difference]: With dead ends: 65 [2024-10-14 01:43:41,819 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 01:43:41,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 66 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 01:43:41,820 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:41,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 104 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:43:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 01:43:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2024-10-14 01:43:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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-10-14 01:43:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-10-14 01:43:41,829 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 40 [2024-10-14 01:43:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:41,829 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-14 01:43:41,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 states have internal predecessors, (44), 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-10-14 01:43:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-10-14 01:43:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 01:43:41,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:41,831 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 01:43:41,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 01:43:42,031 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-10-14 01:43:42,032 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:42,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash -74912876, now seen corresponding path program 1 times [2024-10-14 01:43:42,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061764255] [2024-10-14 01:43:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:42,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 01:43:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 01:43:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:42,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 01:43:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:43:42,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061764255] [2024-10-14 01:43:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061764255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:43:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305562485] [2024-10-14 01:43:42,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:42,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:43:42,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:42,184 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-10-14 01:43:42,187 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-10-14 01:43:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:42,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 01:43:42,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:43:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 01:43:42,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:43:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 01:43:42,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305562485] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:43:42,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:43:42,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 16 [2024-10-14 01:43:42,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195346422] [2024-10-14 01:43:42,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:43:42,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 01:43:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:42,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 01:43:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-14 01:43:42,432 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 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-10-14 01:43:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:42,631 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-10-14 01:43:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:43:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 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 40 [2024-10-14 01:43:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:42,632 INFO L225 Difference]: With dead ends: 58 [2024-10-14 01:43:42,632 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 01:43:42,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-10-14 01:43:42,633 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:42,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:43:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 01:43:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 01:43:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 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-10-14 01:43:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-14 01:43:42,642 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 40 [2024-10-14 01:43:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:42,642 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-14 01:43:42,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 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-10-14 01:43:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-14 01:43:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 01:43:42,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:42,644 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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-10-14 01:43:42,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 01:43:42,844 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-10-14 01:43:42,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:42,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1736769837, now seen corresponding path program 1 times [2024-10-14 01:43:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:42,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911501535] [2024-10-14 01:43:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:43:42,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 01:43:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:43:42,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 01:43:42,905 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 01:43:42,906 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:43:42,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 01:43:42,912 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:42,960 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:43:42,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:43:42 BoogieIcfgContainer [2024-10-14 01:43:42,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:43:42,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:43:42,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:43:42,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:43:42,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:31" (3/4) ... [2024-10-14 01:43:42,964 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 01:43:43,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:43:43,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:43:43,023 INFO L158 Benchmark]: Toolchain (without parser) took 12633.86ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 108.8MB in the beginning and 142.1MB in the end (delta: -33.3MB). Peak memory consumption was 659.1kB. Max. memory is 16.1GB. [2024-10-14 01:43:43,023 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 100.7MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:43:43,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.79ms. Allocated memory is still 153.1MB. Free memory was 108.8MB in the beginning and 90.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 01:43:43,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.57ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 88.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:43:43,023 INFO L158 Benchmark]: Boogie Preprocessor took 41.56ms. Allocated memory is still 153.1MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:43:43,024 INFO L158 Benchmark]: RCFGBuilder took 545.47ms. Allocated memory is still 153.1MB. Free memory was 86.3MB in the beginning and 111.7MB in the end (delta: -25.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 01:43:43,024 INFO L158 Benchmark]: TraceAbstraction took 11481.28ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 110.5MB in the beginning and 146.3MB in the end (delta: -35.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:43:43,024 INFO L158 Benchmark]: Witness Printer took 59.62ms. Allocated memory is still 186.6MB. Free memory was 146.3MB in the beginning and 142.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:43:43,028 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.24ms. Allocated memory is still 100.7MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.79ms. Allocated memory is still 153.1MB. Free memory was 108.8MB in the beginning and 90.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.57ms. Allocated memory is still 153.1MB. Free memory was 90.4MB in the beginning and 88.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.56ms. Allocated memory is still 153.1MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.47ms. Allocated memory is still 153.1MB. Free memory was 86.3MB in the beginning and 111.7MB in the end (delta: -25.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11481.28ms. Allocated memory was 153.1MB in the beginning and 186.6MB in the end (delta: 33.6MB). Free memory was 110.5MB in the beginning and 146.3MB in the end (delta: -35.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.62ms. Allocated memory is still 186.6MB. Free memory was 146.3MB in the beginning and 142.1MB 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; [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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 476 mSDsluCounter, 851 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 696 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3551 IncrementalHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 155 mSDtfsCounter, 3551 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 367 SyntacticMatches, 45 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred 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.3s InterpolantComputationTime, 528 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 662 ConstructedInterpolants, 0 QuantifiedInterpolants, 2273 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1418 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 149/228 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-10-14 01:43:43,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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