./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/combinations/Problem05_label41+token_ring.02.cil-1.c -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 b46aca8db2cbcc86d5081568217304f7c2d4c7c32814797814cc0c73772f5e13 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:52:33,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:52:33,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:52:33,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:52:33,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:52:33,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:52:33,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:52:33,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:52:33,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:52:33,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:52:33,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:52:33,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:52:33,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:52:33,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:52:33,726 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:52:33,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:52:33,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:52:33,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:52:33,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:52:33,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:52:33,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:52:33,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:52:33,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:52:33,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:52:33,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:52:33,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:52:33,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:52:33,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:52:33,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:52:33,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:52:33,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:52:33,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:52:33,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:52:33,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:52:33,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:52:33,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:52:33,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:52:33,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:52:33,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:52:33,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:52:33,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:52:33,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:52:33,740 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 -> b46aca8db2cbcc86d5081568217304f7c2d4c7c32814797814cc0c73772f5e13 [2024-10-12 20:52:34,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:52:34,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:52:34,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:52:34,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:52:34,040 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:52:34,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.02.cil-1.c [2024-10-12 20:52:35,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:52:36,247 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:52:36,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.02.cil-1.c [2024-10-12 20:52:36,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03e791453/04dc0eb773854db8bb74451faa7fb3a1/FLAG04b84d258 [2024-10-12 20:52:36,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03e791453/04dc0eb773854db8bb74451faa7fb3a1 [2024-10-12 20:52:36,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:52:36,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:52:36,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:52:36,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:52:36,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:52:36,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:52:36" (1/1) ... [2024-10-12 20:52:36,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb94f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:36, skipping insertion in model container [2024-10-12 20:52:36,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:52:36" (1/1) ... [2024-10-12 20:52:36,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:52:38,111 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/combinations/Problem05_label41+token_ring.02.cil-1.c[376251,376264] [2024-10-12 20:52:38,139 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/combinations/Problem05_label41+token_ring.02.cil-1.c[383339,383352] [2024-10-12 20:52:38,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:52:38,284 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:52:39,086 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/combinations/Problem05_label41+token_ring.02.cil-1.c[376251,376264] [2024-10-12 20:52:39,096 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/combinations/Problem05_label41+token_ring.02.cil-1.c[383339,383352] [2024-10-12 20:52:39,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:52:39,176 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:52:39,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39 WrapperNode [2024-10-12 20:52:39,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:52:39,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:52:39,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:52:39,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:52:39,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:39,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:39,646 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12633 [2024-10-12 20:52:39,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:52:39,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:52:39,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:52:39,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:52:39,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:39,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:39,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:39,894 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:52:39,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:39,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:40,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:40,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:40,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:40,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:40,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:52:40,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:52:40,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:52:40,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:52:40,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (1/1) ... [2024-10-12 20:52:40,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:52:40,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:52:40,337 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-12 20:52:40,340 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-12 20:52:40,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:52:40,383 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:52:40,384 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:52:40,384 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:52:40,385 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:52:40,385 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:52:40,386 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:52:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:52:40,386 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:52:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:52:40,386 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:52:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:52:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:52:40,386 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:52:40,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:52:40,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:52:40,478 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:52:40,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:52:47,727 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2024-10-12 20:52:47,728 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:52:47,828 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:52:47,828 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-12 20:52:47,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:52:47 BoogieIcfgContainer [2024-10-12 20:52:47,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:52:47,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:52:47,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:52:47,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:52:47,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:52:36" (1/3) ... [2024-10-12 20:52:47,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d624bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:52:47, skipping insertion in model container [2024-10-12 20:52:47,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:39" (2/3) ... [2024-10-12 20:52:47,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d624bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:52:47, skipping insertion in model container [2024-10-12 20:52:47,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:52:47" (3/3) ... [2024-10-12 20:52:47,841 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.02.cil-1.c [2024-10-12 20:52:47,860 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:52:47,860 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:52:47,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:52:48,005 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;@689eecc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:52:48,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:52:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-12 20:52:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:52:48,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:48,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:48,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -584044612, now seen corresponding path program 1 times [2024-10-12 20:52:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369072447] [2024-10-12 20:52:48,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:48,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:48,586 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-12 20:52:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369072447] [2024-10-12 20:52:48,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369072447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:52:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442516058] [2024-10-12 20:52:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:48,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:52:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:52:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:52:48,627 INFO L87 Difference]: Start difference. First operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:49,712 INFO L93 Difference]: Finished difference Result 4643 states and 8686 transitions. [2024-10-12 20:52:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:52:49,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-12 20:52:49,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:49,744 INFO L225 Difference]: With dead ends: 4643 [2024-10-12 20:52:49,744 INFO L226 Difference]: Without dead ends: 2404 [2024-10-12 20:52:49,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:52:49,759 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4350 mSDsluCounter, 12142 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 16199 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:49,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 16199 Invalid, 691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:52:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-10-12 20:52:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2345. [2024-10-12 20:52:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2303 states have (on average 1.84020842379505) internal successors, (4238), 2306 states have internal predecessors, (4238), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-10-12 20:52:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4295 transitions. [2024-10-12 20:52:49,927 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 4295 transitions. Word has length 61 [2024-10-12 20:52:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:49,928 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 4295 transitions. [2024-10-12 20:52:49,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 4295 transitions. [2024-10-12 20:52:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:52:49,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:49,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:49,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:52:49,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:49,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:49,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404092, now seen corresponding path program 1 times [2024-10-12 20:52:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828261375] [2024-10-12 20:52:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,159 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-12 20:52:50,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828261375] [2024-10-12 20:52:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828261375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:50,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:52:50,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8955972] [2024-10-12 20:52:50,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:50,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:52:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:50,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:52:50,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:50,164 INFO L87 Difference]: Start difference. First operand 2345 states and 4295 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:51,252 INFO L93 Difference]: Finished difference Result 2757 states and 4924 transitions. [2024-10-12 20:52:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:52:51,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-12 20:52:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:51,266 INFO L225 Difference]: With dead ends: 2757 [2024-10-12 20:52:51,267 INFO L226 Difference]: Without dead ends: 2541 [2024-10-12 20:52:51,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:52:51,270 INFO L432 NwaCegarLoop]: 4121 mSDtfsCounter, 4342 mSDsluCounter, 16314 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4351 SdHoareTripleChecker+Valid, 20435 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:51,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4351 Valid, 20435 Invalid, 1048 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:52:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2024-10-12 20:52:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2446. [2024-10-12 20:52:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2386 states have (on average 1.8281642917015926) internal successors, (4362), 2390 states have internal predecessors, (4362), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-12 20:52:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4443 transitions. [2024-10-12 20:52:51,366 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4443 transitions. Word has length 61 [2024-10-12 20:52:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:51,368 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4443 transitions. [2024-10-12 20:52:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4443 transitions. [2024-10-12 20:52:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:52:51,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:51,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:51,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:52:51,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1408885374, now seen corresponding path program 1 times [2024-10-12 20:52:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903018743] [2024-10-12 20:52:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:51,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:51,559 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-12 20:52:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903018743] [2024-10-12 20:52:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903018743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:51,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:51,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:52:51,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103467090] [2024-10-12 20:52:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:52:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:52:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:51,565 INFO L87 Difference]: Start difference. First operand 2446 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:52,543 INFO L93 Difference]: Finished difference Result 3115 states and 5460 transitions. [2024-10-12 20:52:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:52:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-12 20:52:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:52,556 INFO L225 Difference]: With dead ends: 3115 [2024-10-12 20:52:52,556 INFO L226 Difference]: Without dead ends: 2798 [2024-10-12 20:52:52,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:52:52,559 INFO L432 NwaCegarLoop]: 4062 mSDtfsCounter, 4378 mSDsluCounter, 16167 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 20229 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:52,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 20229 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:52:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-12 20:52:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2649. [2024-10-12 20:52:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2553 states have (on average 1.8061104582843712) internal successors, (4611), 2559 states have internal predecessors, (4611), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-12 20:52:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4744 transitions. [2024-10-12 20:52:52,640 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4744 transitions. Word has length 61 [2024-10-12 20:52:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:52,640 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 4744 transitions. [2024-10-12 20:52:52,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4744 transitions. [2024-10-12 20:52:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:52:52,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:52,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:52,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:52:52,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:52,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash -946919876, now seen corresponding path program 1 times [2024-10-12 20:52:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:52,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87263702] [2024-10-12 20:52:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:52,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:52,795 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-12 20:52:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87263702] [2024-10-12 20:52:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87263702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:52,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:52,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:52:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129988363] [2024-10-12 20:52:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:52:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:52,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:52:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:52,798 INFO L87 Difference]: Start difference. First operand 2649 states and 4744 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:53,865 INFO L93 Difference]: Finished difference Result 3887 states and 6619 transitions. [2024-10-12 20:52:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:52:53,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-12 20:52:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:53,881 INFO L225 Difference]: With dead ends: 3887 [2024-10-12 20:52:53,882 INFO L226 Difference]: Without dead ends: 3367 [2024-10-12 20:52:53,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:52:53,886 INFO L432 NwaCegarLoop]: 4116 mSDtfsCounter, 4350 mSDsluCounter, 16306 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4358 SdHoareTripleChecker+Valid, 20422 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:53,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4358 Valid, 20422 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:52:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-10-12 20:52:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3033. [2024-10-12 20:52:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2869 states have (on average 1.7716974555594285) internal successors, (5083), 2879 states have internal predecessors, (5083), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2024-10-12 20:52:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 5318 transitions. [2024-10-12 20:52:54,006 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 5318 transitions. Word has length 61 [2024-10-12 20:52:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:54,006 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 5318 transitions. [2024-10-12 20:52:54,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 5318 transitions. [2024-10-12 20:52:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:52:54,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:54,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:54,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:52:54,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:54,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 981352826, now seen corresponding path program 1 times [2024-10-12 20:52:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121213552] [2024-10-12 20:52:54,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:54,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,136 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-12 20:52:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:54,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121213552] [2024-10-12 20:52:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121213552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:54,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:52:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231376472] [2024-10-12 20:52:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:54,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:52:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:52:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:54,139 INFO L87 Difference]: Start difference. First operand 3033 states and 5318 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:55,110 INFO L93 Difference]: Finished difference Result 5185 states and 8559 transitions. [2024-10-12 20:52:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:52:55,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-12 20:52:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:55,133 INFO L225 Difference]: With dead ends: 5185 [2024-10-12 20:52:55,134 INFO L226 Difference]: Without dead ends: 4281 [2024-10-12 20:52:55,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:52:55,140 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4350 mSDsluCounter, 16309 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4362 SdHoareTripleChecker+Valid, 20426 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:55,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4362 Valid, 20426 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:52:55,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-10-12 20:52:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3818. [2024-10-12 20:52:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3522 states have (on average 1.7208972174900625) internal successors, (6061), 3540 states have internal predecessors, (6061), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2024-10-12 20:52:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 6510 transitions. [2024-10-12 20:52:55,399 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 6510 transitions. Word has length 61 [2024-10-12 20:52:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:55,400 INFO L471 AbstractCegarLoop]: Abstraction has 3818 states and 6510 transitions. [2024-10-12 20:52:55,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 6510 transitions. [2024-10-12 20:52:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:52:55,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:55,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:52:55,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1874839164, now seen corresponding path program 1 times [2024-10-12 20:52:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631602126] [2024-10-12 20:52:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:55,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:55,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:55,511 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-12 20:52:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631602126] [2024-10-12 20:52:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631602126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:55,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:55,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:52:55,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63782866] [2024-10-12 20:52:55,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:55,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:52:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:55,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:52:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:52:55,515 INFO L87 Difference]: Start difference. First operand 3818 states and 6510 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:56,393 INFO L93 Difference]: Finished difference Result 6913 states and 11211 transitions. [2024-10-12 20:52:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:52:56,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-12 20:52:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:56,415 INFO L225 Difference]: With dead ends: 6913 [2024-10-12 20:52:56,415 INFO L226 Difference]: Without dead ends: 5225 [2024-10-12 20:52:56,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:52:56,424 INFO L432 NwaCegarLoop]: 4142 mSDtfsCounter, 4472 mSDsluCounter, 12167 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 16309 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:56,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 16309 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:52:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2024-10-12 20:52:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4690. [2024-10-12 20:52:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4690 states, 4236 states have (on average 1.674929178470255) internal successors, (7095), 4271 states have internal predecessors, (7095), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-12 20:52:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 7764 transitions. [2024-10-12 20:52:56,610 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 7764 transitions. Word has length 61 [2024-10-12 20:52:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:56,611 INFO L471 AbstractCegarLoop]: Abstraction has 4690 states and 7764 transitions. [2024-10-12 20:52:56,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:52:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 7764 transitions. [2024-10-12 20:52:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:52:56,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:56,618 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:56,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:52:56,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:56,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:56,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2042674346, now seen corresponding path program 1 times [2024-10-12 20:52:56,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:56,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997300937] [2024-10-12 20:52:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:52:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:52:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:52:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:52:56,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997300937] [2024-10-12 20:52:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997300937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:52:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171897634] [2024-10-12 20:52:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:56,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:52:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:52:56,750 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-12 20:52:56,751 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-12 20:52:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:56,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:52:56,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:52:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 20:52:56,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:52:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171897634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:52:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:52:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142184067] [2024-10-12 20:52:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:56,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:52:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:56,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:52:56,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:56,932 INFO L87 Difference]: Start difference. First operand 4690 states and 7764 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:52:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:57,322 INFO L93 Difference]: Finished difference Result 9693 states and 15244 transitions. [2024-10-12 20:52:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:52:57,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2024-10-12 20:52:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:57,373 INFO L225 Difference]: With dead ends: 9693 [2024-10-12 20:52:57,373 INFO L226 Difference]: Without dead ends: 7133 [2024-10-12 20:52:57,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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-12 20:52:57,384 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4092 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:57,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4254 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:52:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2024-10-12 20:52:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 7105. [2024-10-12 20:52:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 6237 states have (on average 1.6091069424402757) internal successors, (10036), 6305 states have internal predecessors, (10036), 510 states have call successors, (510), 308 states have call predecessors, (510), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2024-10-12 20:52:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 11291 transitions. [2024-10-12 20:52:57,720 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 11291 transitions. Word has length 99 [2024-10-12 20:52:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:57,722 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 11291 transitions. [2024-10-12 20:52:57,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:52:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 11291 transitions. [2024-10-12 20:52:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:52:57,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:57,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:57,753 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-12 20:52:57,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:52:57,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:57,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:57,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1877378954, now seen corresponding path program 1 times [2024-10-12 20:52:57,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:57,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795668135] [2024-10-12 20:52:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:57,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:52:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:52:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:52:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:52:58,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:58,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795668135] [2024-10-12 20:52:58,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795668135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:52:58,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829581592] [2024-10-12 20:52:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:58,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:52:58,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:52:58,056 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-12 20:52:58,057 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-12 20:52:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:52:58,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:52:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 20:52:58,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:52:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829581592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:52:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:52:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525210494] [2024-10-12 20:52:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:58,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:52:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:52:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:58,185 INFO L87 Difference]: Start difference. First operand 7105 states and 11291 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:52:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:58,737 INFO L93 Difference]: Finished difference Result 16767 states and 25811 transitions. [2024-10-12 20:52:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:52:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-10-12 20:52:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:58,785 INFO L225 Difference]: With dead ends: 16767 [2024-10-12 20:52:58,785 INFO L226 Difference]: Without dead ends: 11793 [2024-10-12 20:52:58,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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-12 20:52:58,806 INFO L432 NwaCegarLoop]: 4254 mSDtfsCounter, 145 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 8367 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:58,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 8367 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:52:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2024-10-12 20:52:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11793. [2024-10-12 20:52:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11793 states, 10112 states have (on average 1.5505340189873418) internal successors, (15679), 10229 states have internal predecessors, (15679), 975 states have call successors, (975), 608 states have call predecessors, (975), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2024-10-12 20:52:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11793 states to 11793 states and 18250 transitions. [2024-10-12 20:52:59,601 INFO L78 Accepts]: Start accepts. Automaton has 11793 states and 18250 transitions. Word has length 99 [2024-10-12 20:52:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:59,602 INFO L471 AbstractCegarLoop]: Abstraction has 11793 states and 18250 transitions. [2024-10-12 20:52:59,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:52:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 11793 states and 18250 transitions. [2024-10-12 20:52:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 20:52:59,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:59,632 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:59,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:52:59,833 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,SelfDestructingSolverStorable7 [2024-10-12 20:52:59,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:59,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:59,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1335572908, now seen corresponding path program 1 times [2024-10-12 20:52:59,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:59,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261918110] [2024-10-12 20:52:59,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:59,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:52:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:52:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:52:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:52:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:52:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:52:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 20:52:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:52:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 20:52:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-12 20:52:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261918110] [2024-10-12 20:52:59,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261918110] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:52:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926754263] [2024-10-12 20:52:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:59,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:52:59,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:52:59,955 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-12 20:52:59,957 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-12 20:53:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:00,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:53:00,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:53:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 20:53:00,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:53:00,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926754263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:00,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:53:00,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:53:00,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614258827] [2024-10-12 20:53:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:00,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:53:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:00,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:53:00,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:00,177 INFO L87 Difference]: Start difference. First operand 11793 states and 18250 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 20:53:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:01,255 INFO L93 Difference]: Finished difference Result 30733 states and 46555 transitions. [2024-10-12 20:53:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:53:01,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2024-10-12 20:53:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:01,380 INFO L225 Difference]: With dead ends: 30733 [2024-10-12 20:53:01,380 INFO L226 Difference]: Without dead ends: 21075 [2024-10-12 20:53:01,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-12 20:53:01,413 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4053 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4053 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:01,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4053 Valid, 4257 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:53:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2024-10-12 20:53:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 20969. [2024-10-12 20:53:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20969 states, 17708 states have (on average 1.5070589564038852) internal successors, (26687), 17939 states have internal predecessors, (26687), 1869 states have call successors, (1869), 1198 states have call predecessors, (1869), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2024-10-12 20:53:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 31594 transitions. [2024-10-12 20:53:02,414 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 31594 transitions. Word has length 127 [2024-10-12 20:53:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:02,415 INFO L471 AbstractCegarLoop]: Abstraction has 20969 states and 31594 transitions. [2024-10-12 20:53:02,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 20:53:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 31594 transitions. [2024-10-12 20:53:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 20:53:02,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:02,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:02,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:53:02,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:02,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash 791512030, now seen corresponding path program 1 times [2024-10-12 20:53:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894280187] [2024-10-12 20:53:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 20:53:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:53:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:53:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 20:53:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 20:53:02,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894280187] [2024-10-12 20:53:02,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894280187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:53:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650852306] [2024-10-12 20:53:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:02,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:02,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:02,791 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-12 20:53:02,792 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-12 20:53:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:02,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:53:02,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:53:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 20:53:02,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:53:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650852306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:02,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:53:02,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:53:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383518272] [2024-10-12 20:53:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:02,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:53:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:53:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:02,962 INFO L87 Difference]: Start difference. First operand 20969 states and 31594 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 20:53:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:04,233 INFO L93 Difference]: Finished difference Result 33443 states and 50451 transitions. [2024-10-12 20:53:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:53:04,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2024-10-12 20:53:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:04,310 INFO L225 Difference]: With dead ends: 33443 [2024-10-12 20:53:04,311 INFO L226 Difference]: Without dead ends: 18715 [2024-10-12 20:53:04,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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-12 20:53:04,353 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4086 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:04,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 4142 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:53:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2024-10-12 20:53:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 14099. [2024-10-12 20:53:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14099 states, 12046 states have (on average 1.4857214012950357) internal successors, (17897), 12167 states have internal predecessors, (17897), 1161 states have call successors, (1161), 794 states have call predecessors, (1161), 890 states have return successors, (1648), 1153 states have call predecessors, (1648), 1161 states have call successors, (1648) [2024-10-12 20:53:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 20706 transitions. [2024-10-12 20:53:05,403 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 20706 transitions. Word has length 143 [2024-10-12 20:53:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:05,404 INFO L471 AbstractCegarLoop]: Abstraction has 14099 states and 20706 transitions. [2024-10-12 20:53:05,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 20:53:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 20706 transitions. [2024-10-12 20:53:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 20:53:05,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:05,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:05,455 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-12 20:53:05,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:05,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:05,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2075302660, now seen corresponding path program 1 times [2024-10-12 20:53:05,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:05,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807386388] [2024-10-12 20:53:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 20:53:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:53:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:53:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 20:53:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 20:53:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807386388] [2024-10-12 20:53:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807386388] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:53:05,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615158862] [2024-10-12 20:53:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:05,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:05,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:05,765 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-12 20:53:05,766 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-12 20:53:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:05,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:53:05,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:53:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-12 20:53:05,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:53:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615158862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:05,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:53:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:53:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375020979] [2024-10-12 20:53:05,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:05,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:53:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:05,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:53:05,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:05,922 INFO L87 Difference]: Start difference. First operand 14099 states and 20706 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 20:53:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:06,783 INFO L93 Difference]: Finished difference Result 23244 states and 33469 transitions. [2024-10-12 20:53:06,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:53:06,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2024-10-12 20:53:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:06,851 INFO L225 Difference]: With dead ends: 23244 [2024-10-12 20:53:06,852 INFO L226 Difference]: Without dead ends: 14923 [2024-10-12 20:53:06,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 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-12 20:53:06,879 INFO L432 NwaCegarLoop]: 4144 mSDtfsCounter, 4079 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:06,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4289 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:53:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2024-10-12 20:53:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 14857. [2024-10-12 20:53:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14857 states, 12716 states have (on average 1.4599716892104435) internal successors, (18565), 12837 states have internal predecessors, (18565), 1183 states have call successors, (1183), 860 states have call predecessors, (1183), 956 states have return successors, (1736), 1175 states have call predecessors, (1736), 1183 states have call successors, (1736) [2024-10-12 20:53:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 21484 transitions. [2024-10-12 20:53:07,968 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 21484 transitions. Word has length 143 [2024-10-12 20:53:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:07,969 INFO L471 AbstractCegarLoop]: Abstraction has 14857 states and 21484 transitions. [2024-10-12 20:53:07,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-12 20:53:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 21484 transitions. [2024-10-12 20:53:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:53:07,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:07,993 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:08,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 20:53:08,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 20:53:08,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:08,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1556193784, now seen corresponding path program 1 times [2024-10-12 20:53:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:08,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251391069] [2024-10-12 20:53:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:53:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:53:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 20:53:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:53:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 20:53:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251391069] [2024-10-12 20:53:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251391069] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:53:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158949587] [2024-10-12 20:53:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:08,433 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-12 20:53:08,434 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-12 20:53:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:08,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:53:08,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:53:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 20:53:08,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:53:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158949587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:53:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:53:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119764789] [2024-10-12 20:53:08,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:08,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:53:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:08,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:53:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:08,570 INFO L87 Difference]: Start difference. First operand 14857 states and 21484 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:53:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:09,701 INFO L93 Difference]: Finished difference Result 39509 states and 55950 transitions. [2024-10-12 20:53:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:53:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-12 20:53:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:09,802 INFO L225 Difference]: With dead ends: 39509 [2024-10-12 20:53:09,802 INFO L226 Difference]: Without dead ends: 26789 [2024-10-12 20:53:09,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-12 20:53:09,834 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 135 mSDsluCounter, 4111 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8363 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:09,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8363 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:53:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2024-10-12 20:53:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 26743. [2024-10-12 20:53:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26743 states, 22644 states have (on average 1.4140169581346052) internal successors, (32019), 22885 states have internal predecessors, (32019), 2245 states have call successors, (2245), 1660 states have call predecessors, (2245), 1852 states have return successors, (3798), 2229 states have call predecessors, (3798), 2245 states have call successors, (3798) [2024-10-12 20:53:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26743 states to 26743 states and 38062 transitions. [2024-10-12 20:53:11,568 INFO L78 Accepts]: Start accepts. Automaton has 26743 states and 38062 transitions. Word has length 144 [2024-10-12 20:53:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:11,569 INFO L471 AbstractCegarLoop]: Abstraction has 26743 states and 38062 transitions. [2024-10-12 20:53:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:53:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 26743 states and 38062 transitions. [2024-10-12 20:53:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:53:11,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:11,601 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:11,618 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-12 20:53:11,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:11,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:11,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 125794537, now seen corresponding path program 1 times [2024-10-12 20:53:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:11,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763959785] [2024-10-12 20:53:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:53:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:53:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:53:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:53:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 20:53:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763959785] [2024-10-12 20:53:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763959785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:53:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897626650] [2024-10-12 20:53:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:11,941 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-12 20:53:11,942 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-12 20:53:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:12,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:53:12,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:53:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 20:53:12,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:53:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897626650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:53:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:53:12,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43340863] [2024-10-12 20:53:12,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:12,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:53:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:12,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:53:12,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:12,137 INFO L87 Difference]: Start difference. First operand 26743 states and 38062 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 20:53:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:13,569 INFO L93 Difference]: Finished difference Result 52491 states and 75074 transitions. [2024-10-12 20:53:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:53:13,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2024-10-12 20:53:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:13,681 INFO L225 Difference]: With dead ends: 52491 [2024-10-12 20:53:13,681 INFO L226 Difference]: Without dead ends: 27885 [2024-10-12 20:53:13,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-12 20:53:13,746 INFO L432 NwaCegarLoop]: 4108 mSDtfsCounter, 4065 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:13,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 4135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:53:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27885 states. [2024-10-12 20:53:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27885 to 27841. [2024-10-12 20:53:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27841 states, 23682 states have (on average 1.3691833460011824) internal successors, (32425), 23923 states have internal predecessors, (32425), 2245 states have call successors, (2245), 1720 states have call predecessors, (2245), 1912 states have return successors, (3754), 2229 states have call predecessors, (3754), 2245 states have call successors, (3754) [2024-10-12 20:53:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27841 states to 27841 states and 38424 transitions. [2024-10-12 20:53:15,533 INFO L78 Accepts]: Start accepts. Automaton has 27841 states and 38424 transitions. Word has length 144 [2024-10-12 20:53:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:15,533 INFO L471 AbstractCegarLoop]: Abstraction has 27841 states and 38424 transitions. [2024-10-12 20:53:15,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 20:53:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27841 states and 38424 transitions. [2024-10-12 20:53:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:53:15,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:15,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:15,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 20:53:15,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:15,770 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:15,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash -782339540, now seen corresponding path program 1 times [2024-10-12 20:53:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:15,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253498982] [2024-10-12 20:53:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:53:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:53:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:53:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:53:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 20:53:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253498982] [2024-10-12 20:53:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253498982] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:53:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744333139] [2024-10-12 20:53:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:15,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:15,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:15,896 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:53:15,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 20:53:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:16,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:53:16,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:53:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 20:53:16,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:53:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744333139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:16,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:53:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:53:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097789163] [2024-10-12 20:53:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:16,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:53:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:53:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:16,026 INFO L87 Difference]: Start difference. First operand 27841 states and 38424 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:53:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:18,542 INFO L93 Difference]: Finished difference Result 75539 states and 103548 transitions. [2024-10-12 20:53:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:53:18,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-12 20:53:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:18,735 INFO L225 Difference]: With dead ends: 75539 [2024-10-12 20:53:18,735 INFO L226 Difference]: Without dead ends: 49843 [2024-10-12 20:53:18,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-12 20:53:18,792 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 139 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 8354 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:18,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 8354 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:53:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49843 states. [2024-10-12 20:53:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49843 to 49841. [2024-10-12 20:53:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49841 states, 41974 states have (on average 1.333468337542288) internal successors, (55971), 42455 states have internal predecessors, (55971), 4265 states have call successors, (4265), 3216 states have call predecessors, (4265), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2024-10-12 20:53:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49841 states to 49841 states and 68436 transitions. [2024-10-12 20:53:22,258 INFO L78 Accepts]: Start accepts. Automaton has 49841 states and 68436 transitions. Word has length 144 [2024-10-12 20:53:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:22,259 INFO L471 AbstractCegarLoop]: Abstraction has 49841 states and 68436 transitions. [2024-10-12 20:53:22,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 20:53:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 49841 states and 68436 transitions. [2024-10-12 20:53:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:53:22,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:22,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:22,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 20:53:22,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-12 20:53:22,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:22,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash -873894743, now seen corresponding path program 1 times [2024-10-12 20:53:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002933539] [2024-10-12 20:53:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:53:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:53:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 20:53:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:53:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 20:53:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-12 20:53:22,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:22,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002933539] [2024-10-12 20:53:22,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002933539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:53:22,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199145807] [2024-10-12 20:53:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:22,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:53:22,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:22,788 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:53:22,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 20:53:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:22,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:53:22,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:53:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 20:53:22,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:53:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199145807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:53:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:53:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693251132] [2024-10-12 20:53:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:22,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:53:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:53:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:22,933 INFO L87 Difference]: Start difference. First operand 49841 states and 68436 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)