./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_label42+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_label42+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 6e28c81ffc5a1b93c1edca1581014bee1ba1c062c6df3b7a8a783721ae21bc12 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:53:41,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:53:42,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:53:42,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:53:42,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:53:42,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:53:42,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:53:42,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:53:42,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:53:42,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:53:42,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:53:42,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:53:42,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:53:42,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:53:42,138 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:53:42,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:53:42,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:53:42,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:53:42,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:53:42,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:53:42,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:53:42,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:53:42,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:53:42,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:53:42,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:53:42,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:53:42,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:53:42,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:53:42,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:53:42,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:53:42,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:53:42,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:53:42,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:53:42,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:53:42,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:53:42,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:53:42,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:53:42,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:53:42,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:53:42,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:53:42,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:53:42,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:53:42,146 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 -> 6e28c81ffc5a1b93c1edca1581014bee1ba1c062c6df3b7a8a783721ae21bc12 [2024-10-12 20:53:42,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:53:42,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:53:42,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:53:42,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:53:42,433 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:53:42,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c [2024-10-12 20:53:43,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:53:44,508 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:53:44,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c [2024-10-12 20:53:44,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a06803a/de15fe2928bb4004b9e3051a73080410/FLAGae56fa3dc [2024-10-12 20:53:44,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a06803a/de15fe2928bb4004b9e3051a73080410 [2024-10-12 20:53:44,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:53:44,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:53:44,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:53:44,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:53:44,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:53:44,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:53:44" (1/1) ... [2024-10-12 20:53:44,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241ba485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:44, skipping insertion in model container [2024-10-12 20:53:44,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:53:44" (1/1) ... [2024-10-12 20:53:44,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:53:46,216 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_label42+token_ring.02.cil-1.c[378560,378573] [2024-10-12 20:53:46,245 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_label42+token_ring.02.cil-1.c[383339,383352] [2024-10-12 20:53:46,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:53:46,393 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:53:47,166 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_label42+token_ring.02.cil-1.c[378560,378573] [2024-10-12 20:53:47,182 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_label42+token_ring.02.cil-1.c[383339,383352] [2024-10-12 20:53:47,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:53:47,321 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:53:47,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47 WrapperNode [2024-10-12 20:53:47,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:53:47,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:53:47,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:53:47,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:53:47,330 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:53:47" (1/1) ... [2024-10-12 20:53:47,409 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:53:47" (1/1) ... [2024-10-12 20:53:47,664 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12633 [2024-10-12 20:53:47,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:53:47,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:53:47,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:53:47,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:53:47,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:47,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:47,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:47,808 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:53:47,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:47,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:48,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:48,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:48,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:48,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:48,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:53:48,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:53:48,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:53:48,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:53:48,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (1/1) ... [2024-10-12 20:53:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:53:48,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:53:48,408 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:53:48,428 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:53:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:53:48,517 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:53:48,518 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:53:48,518 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:53:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:53:48,523 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:53:48,523 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:53:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:53:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:53:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:53:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:53:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:53:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:53:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:53:48,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:53:48,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:53:48,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:53:48,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:53:56,070 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2024-10-12 20:53:56,071 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:53:56,185 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:53:56,185 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-12 20:53:56,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:53:56 BoogieIcfgContainer [2024-10-12 20:53:56,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:53:56,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:53:56,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:53:56,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:53:56,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:53:44" (1/3) ... [2024-10-12 20:53:56,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3430dbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:53:56, skipping insertion in model container [2024-10-12 20:53:56,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:53:47" (2/3) ... [2024-10-12 20:53:56,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3430dbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:53:56, skipping insertion in model container [2024-10-12 20:53:56,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:53:56" (3/3) ... [2024-10-12 20:53:56,195 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.02.cil-1.c [2024-10-12 20:53:56,212 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:53:56,212 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:53:56,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:53:56,355 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;@638ff303, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:53:56,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:53:56,368 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:53:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:53:56,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:56,387 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:53:56,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash -584044612, now seen corresponding path program 1 times [2024-10-12 20:53:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170546342] [2024-10-12 20:53:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:56,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:56,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:56,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:56,909 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:53:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170546342] [2024-10-12 20:53:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170546342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:56,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:53:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319078612] [2024-10-12 20:53:56,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:53:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:56,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:53:56,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:53:56,953 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:53:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:57,982 INFO L93 Difference]: Finished difference Result 4643 states and 8686 transitions. [2024-10-12 20:53:57,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:53:57,985 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:53:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:58,013 INFO L225 Difference]: With dead ends: 4643 [2024-10-12 20:53:58,014 INFO L226 Difference]: Without dead ends: 2404 [2024-10-12 20:53:58,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:53:58,031 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4350 mSDsluCounter, 12142 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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:53:58,033 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:53:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-10-12 20:53:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2345. [2024-10-12 20:53:58,167 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:53:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4295 transitions. [2024-10-12 20:53:58,181 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 4295 transitions. Word has length 61 [2024-10-12 20:53:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 4295 transitions. [2024-10-12 20:53:58,182 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:53:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 4295 transitions. [2024-10-12 20:53:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:53:58,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:58,185 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:53:58,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:53:58,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:58,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404092, now seen corresponding path program 1 times [2024-10-12 20:53:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:58,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774461780] [2024-10-12 20:53:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:58,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:58,404 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:53:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774461780] [2024-10-12 20:53:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774461780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:58,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:58,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:58,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622106880] [2024-10-12 20:53:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:58,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:58,413 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:53:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:59,680 INFO L93 Difference]: Finished difference Result 2757 states and 4924 transitions. [2024-10-12 20:53:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:53:59,681 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:53:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:59,692 INFO L225 Difference]: With dead ends: 2757 [2024-10-12 20:53:59,692 INFO L226 Difference]: Without dead ends: 2541 [2024-10-12 20:53:59,694 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:53:59,695 INFO L432 NwaCegarLoop]: 4121 mSDtfsCounter, 4342 mSDsluCounter, 16314 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:59,695 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.9s Time] [2024-10-12 20:53:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2024-10-12 20:53:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2446. [2024-10-12 20:53:59,767 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:53:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4443 transitions. [2024-10-12 20:53:59,778 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4443 transitions. Word has length 61 [2024-10-12 20:53:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:59,779 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4443 transitions. [2024-10-12 20:53:59,779 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:53:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4443 transitions. [2024-10-12 20:53:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:53:59,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:59,781 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:53:59,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:53:59,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1408885374, now seen corresponding path program 1 times [2024-10-12 20:53:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:59,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945592608] [2024-10-12 20:53:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:59,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:53:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:53:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:53:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:59,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:53:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:59,976 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:53:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945592608] [2024-10-12 20:53:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945592608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:59,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:59,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461430634] [2024-10-12 20:53:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:59,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:59,982 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:54:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:01,010 INFO L93 Difference]: Finished difference Result 3115 states and 5460 transitions. [2024-10-12 20:54:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:54:01,011 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:54:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:01,026 INFO L225 Difference]: With dead ends: 3115 [2024-10-12 20:54:01,026 INFO L226 Difference]: Without dead ends: 2798 [2024-10-12 20:54:01,028 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:54:01,029 INFO L432 NwaCegarLoop]: 4062 mSDtfsCounter, 4378 mSDsluCounter, 16167 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 20229 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:01,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 20229 Invalid, 887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:54:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-12 20:54:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2649. [2024-10-12 20:54:01,127 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:54:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4744 transitions. [2024-10-12 20:54:01,138 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4744 transitions. Word has length 61 [2024-10-12 20:54:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 4744 transitions. [2024-10-12 20:54:01,139 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:54:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4744 transitions. [2024-10-12 20:54:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:54:01,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:01,142 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:54:01,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:54:01,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:01,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash -946919876, now seen corresponding path program 1 times [2024-10-12 20:54:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341024175] [2024-10-12 20:54:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:01,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:01,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:01,308 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:54:01,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341024175] [2024-10-12 20:54:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341024175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:01,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:01,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893249991] [2024-10-12 20:54:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:01,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:01,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:01,312 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:54:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:02,434 INFO L93 Difference]: Finished difference Result 3887 states and 6619 transitions. [2024-10-12 20:54:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:02,435 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:54:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:02,453 INFO L225 Difference]: With dead ends: 3887 [2024-10-12 20:54:02,453 INFO L226 Difference]: Without dead ends: 3367 [2024-10-12 20:54:02,456 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:54:02,458 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.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:02,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4358 Valid, 20422 Invalid, 1128 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:54:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-10-12 20:54:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3033. [2024-10-12 20:54:02,608 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:54:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 5318 transitions. [2024-10-12 20:54:02,621 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 5318 transitions. Word has length 61 [2024-10-12 20:54:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:02,621 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 5318 transitions. [2024-10-12 20:54:02,622 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:54:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 5318 transitions. [2024-10-12 20:54:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:54:02,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:02,624 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:54:02,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:54:02,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:02,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash 981352826, now seen corresponding path program 1 times [2024-10-12 20:54:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326706549] [2024-10-12 20:54:02,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:02,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:02,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:02,772 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:54:02,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326706549] [2024-10-12 20:54:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326706549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:02,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:02,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:02,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868644917] [2024-10-12 20:54:02,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:02,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:02,777 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:54:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:03,829 INFO L93 Difference]: Finished difference Result 5185 states and 8559 transitions. [2024-10-12 20:54:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:03,830 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:54:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:03,850 INFO L225 Difference]: With dead ends: 5185 [2024-10-12 20:54:03,850 INFO L226 Difference]: Without dead ends: 4281 [2024-10-12 20:54:03,856 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:54:03,858 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:54:03,858 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:54:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-10-12 20:54:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3818. [2024-10-12 20:54:04,007 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:54:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 6510 transitions. [2024-10-12 20:54:04,018 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 6510 transitions. Word has length 61 [2024-10-12 20:54:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:04,019 INFO L471 AbstractCegarLoop]: Abstraction has 3818 states and 6510 transitions. [2024-10-12 20:54:04,019 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:54:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 6510 transitions. [2024-10-12 20:54:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 20:54:04,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:04,022 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:54:04,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:54:04,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:04,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1874839164, now seen corresponding path program 1 times [2024-10-12 20:54:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:04,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716005617] [2024-10-12 20:54:04,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:04,106 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:54:04,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:04,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716005617] [2024-10-12 20:54:04,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716005617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:04,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:04,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:54:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704828036] [2024-10-12 20:54:04,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:04,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:54:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:04,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:54:04,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:54:04,109 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:54:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:05,037 INFO L93 Difference]: Finished difference Result 6913 states and 11211 transitions. [2024-10-12 20:54:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:54:05,038 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:54:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:05,062 INFO L225 Difference]: With dead ends: 6913 [2024-10-12 20:54:05,063 INFO L226 Difference]: Without dead ends: 5225 [2024-10-12 20:54:05,070 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:54:05,073 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:54:05,073 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:54:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2024-10-12 20:54:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4690. [2024-10-12 20:54:05,293 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:54:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 7764 transitions. [2024-10-12 20:54:05,318 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 7764 transitions. Word has length 61 [2024-10-12 20:54:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:05,318 INFO L471 AbstractCegarLoop]: Abstraction has 4690 states and 7764 transitions. [2024-10-12 20:54:05,319 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:54:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 7764 transitions. [2024-10-12 20:54:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:54:05,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:05,327 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:54:05,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:54:05,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:05,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2042674346, now seen corresponding path program 1 times [2024-10-12 20:54:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:05,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806564751] [2024-10-12 20:54:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:54:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:54:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,475 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:54:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806564751] [2024-10-12 20:54:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806564751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130403984] [2024-10-12 20:54:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:05,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:05,481 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:54:05,482 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:54:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:05,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:05,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:05,663 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:54:05,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130403984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:05,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:54:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353614746] [2024-10-12 20:54:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:05,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:05,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:05,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:05,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:05,670 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:54:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:05,972 INFO L93 Difference]: Finished difference Result 9693 states and 15244 transitions. [2024-10-12 20:54:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:05,973 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:54:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:06,006 INFO L225 Difference]: With dead ends: 9693 [2024-10-12 20:54:06,007 INFO L226 Difference]: Without dead ends: 7133 [2024-10-12 20:54:06,018 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:54:06,021 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:54:06,021 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:54:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2024-10-12 20:54:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 7105. [2024-10-12 20:54:06,417 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:54:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 11291 transitions. [2024-10-12 20:54:06,440 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 11291 transitions. Word has length 99 [2024-10-12 20:54:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 11291 transitions. [2024-10-12 20:54:06,442 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:54:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 11291 transitions. [2024-10-12 20:54:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:54:06,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:06,452 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:54:06,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 20:54:06,656 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:54:06,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1877378954, now seen corresponding path program 1 times [2024-10-12 20:54:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145936587] [2024-10-12 20:54:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:54:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:54:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,788 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:54:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145936587] [2024-10-12 20:54:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145936587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509359831] [2024-10-12 20:54:06,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:06,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:06,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:06,792 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:54:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:06,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:06,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:06,905 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:54:06,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509359831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9612102] [2024-10-12 20:54:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:06,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:06,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:06,907 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:54:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:07,419 INFO L93 Difference]: Finished difference Result 16767 states and 25811 transitions. [2024-10-12 20:54:07,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:07,420 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:54:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:07,472 INFO L225 Difference]: With dead ends: 16767 [2024-10-12 20:54:07,473 INFO L226 Difference]: Without dead ends: 11793 [2024-10-12 20:54:07,494 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:54:07,496 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:54:07,497 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:54:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2024-10-12 20:54:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11793. [2024-10-12 20:54:08,127 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:54:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11793 states to 11793 states and 18250 transitions. [2024-10-12 20:54:08,164 INFO L78 Accepts]: Start accepts. Automaton has 11793 states and 18250 transitions. Word has length 99 [2024-10-12 20:54:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:08,164 INFO L471 AbstractCegarLoop]: Abstraction has 11793 states and 18250 transitions. [2024-10-12 20:54:08,164 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:54:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11793 states and 18250 transitions. [2024-10-12 20:54:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 20:54:08,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:08,191 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:54:08,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:54:08,391 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:54:08,391 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:08,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1335572908, now seen corresponding path program 1 times [2024-10-12 20:54:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570805404] [2024-10-12 20:54:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:54:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 20:54:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 20:54:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,495 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:54:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570805404] [2024-10-12 20:54:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570805404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894097883] [2024-10-12 20:54:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:08,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:08,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:08,498 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:54:08,500 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:54:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:08,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:08,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:08,708 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:54:08,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894097883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:54:08,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473786414] [2024-10-12 20:54:08,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:08,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:08,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:08,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:08,711 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:54:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:09,898 INFO L93 Difference]: Finished difference Result 30733 states and 46555 transitions. [2024-10-12 20:54:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:09,898 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:54:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:09,993 INFO L225 Difference]: With dead ends: 30733 [2024-10-12 20:54:09,993 INFO L226 Difference]: Without dead ends: 21075 [2024-10-12 20:54:10,039 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:54:10,040 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:54:10,040 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:54:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2024-10-12 20:54:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 20969. [2024-10-12 20:54:11,412 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:54:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 31594 transitions. [2024-10-12 20:54:11,702 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 31594 transitions. Word has length 127 [2024-10-12 20:54:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:11,837 INFO L471 AbstractCegarLoop]: Abstraction has 20969 states and 31594 transitions. [2024-10-12 20:54:11,837 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:54:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 31594 transitions. [2024-10-12 20:54:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 20:54:11,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:11,895 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:54:11,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:54:12,095 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:54:12,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:12,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash 791512030, now seen corresponding path program 1 times [2024-10-12 20:54:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200447994] [2024-10-12 20:54:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 20:54:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:54:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:54:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 20:54:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,203 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:54:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200447994] [2024-10-12 20:54:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200447994] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023664485] [2024-10-12 20:54:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:12,206 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:54:12,207 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:54:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:12,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:12,389 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:54:12,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:12,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023664485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:12,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225441254] [2024-10-12 20:54:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:12,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:12,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:12,391 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:54:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:13,433 INFO L93 Difference]: Finished difference Result 33443 states and 50451 transitions. [2024-10-12 20:54:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:13,434 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:54:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:13,509 INFO L225 Difference]: With dead ends: 33443 [2024-10-12 20:54:13,510 INFO L226 Difference]: Without dead ends: 18715 [2024-10-12 20:54:13,557 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:54:13,558 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:54:13,558 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:54:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2024-10-12 20:54:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 14099. [2024-10-12 20:54:14,445 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:54:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 20706 transitions. [2024-10-12 20:54:14,487 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 20706 transitions. Word has length 143 [2024-10-12 20:54:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 14099 states and 20706 transitions. [2024-10-12 20:54:14,487 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:54:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 20706 transitions. [2024-10-12 20:54:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 20:54:14,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:14,512 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:54:14,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 20:54:14,713 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:54:14,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:14,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2075302660, now seen corresponding path program 1 times [2024-10-12 20:54:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332551944] [2024-10-12 20:54:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 20:54:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:54:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:54:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 20:54:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,847 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:54:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332551944] [2024-10-12 20:54:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332551944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413287446] [2024-10-12 20:54:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:14,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:14,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:14,850 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:54:14,851 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:54:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:14,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:54:14,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:14,998 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:54:14,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413287446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080951728] [2024-10-12 20:54:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:15,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:15,002 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:54:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:15,952 INFO L93 Difference]: Finished difference Result 23244 states and 33469 transitions. [2024-10-12 20:54:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:15,953 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:54:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:16,005 INFO L225 Difference]: With dead ends: 23244 [2024-10-12 20:54:16,005 INFO L226 Difference]: Without dead ends: 14923 [2024-10-12 20:54:16,021 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:54:16,022 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:54:16,022 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:54:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2024-10-12 20:54:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 14857. [2024-10-12 20:54:16,747 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:54:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 21484 transitions. [2024-10-12 20:54:16,784 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 21484 transitions. Word has length 143 [2024-10-12 20:54:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:16,785 INFO L471 AbstractCegarLoop]: Abstraction has 14857 states and 21484 transitions. [2024-10-12 20:54:16,785 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:54:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 21484 transitions. [2024-10-12 20:54:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:54:16,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:16,807 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:54:16,825 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:54:17,008 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:54:17,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1556193784, now seen corresponding path program 1 times [2024-10-12 20:54:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702817987] [2024-10-12 20:54:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:54:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:54:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 20:54:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:54:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,123 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:54:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702817987] [2024-10-12 20:54:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702817987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679524963] [2024-10-12 20:54:17,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:17,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:17,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:17,126 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:54:17,127 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:54:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:17,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:17,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:17,259 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:54:17,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679524963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324843895] [2024-10-12 20:54:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:17,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:17,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:17,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:17,262 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:54:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:18,689 INFO L93 Difference]: Finished difference Result 39509 states and 55950 transitions. [2024-10-12 20:54:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:18,689 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:54:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:18,790 INFO L225 Difference]: With dead ends: 39509 [2024-10-12 20:54:18,790 INFO L226 Difference]: Without dead ends: 26789 [2024-10-12 20:54:18,825 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:54:18,825 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.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:18,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8363 Invalid, 49 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:54:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2024-10-12 20:54:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 26743. [2024-10-12 20:54:20,607 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:54:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26743 states to 26743 states and 38062 transitions. [2024-10-12 20:54:20,681 INFO L78 Accepts]: Start accepts. Automaton has 26743 states and 38062 transitions. Word has length 144 [2024-10-12 20:54:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:20,681 INFO L471 AbstractCegarLoop]: Abstraction has 26743 states and 38062 transitions. [2024-10-12 20:54:20,681 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:54:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 26743 states and 38062 transitions. [2024-10-12 20:54:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:54:20,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:20,824 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:54:20,842 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:54:21,024 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:54:21,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 125794537, now seen corresponding path program 1 times [2024-10-12 20:54:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008835064] [2024-10-12 20:54:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:21,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:54:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:54:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:54:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:54:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,194 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:54:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008835064] [2024-10-12 20:54:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008835064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059592925] [2024-10-12 20:54:21,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:21,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:21,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:21,197 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:54:21,199 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:54:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:21,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:21,388 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:54:21,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:21,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059592925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:21,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:21,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:21,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373205941] [2024-10-12 20:54:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:21,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:21,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:21,390 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:54:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:22,871 INFO L93 Difference]: Finished difference Result 52491 states and 75074 transitions. [2024-10-12 20:54:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:22,871 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:54:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:22,997 INFO L225 Difference]: With dead ends: 52491 [2024-10-12 20:54:22,998 INFO L226 Difference]: Without dead ends: 27885 [2024-10-12 20:54:23,069 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:54:23,069 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:54:23,070 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:54:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27885 states. [2024-10-12 20:54:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27885 to 27841. [2024-10-12 20:54:24,568 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:54:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27841 states to 27841 states and 38424 transitions. [2024-10-12 20:54:24,627 INFO L78 Accepts]: Start accepts. Automaton has 27841 states and 38424 transitions. Word has length 144 [2024-10-12 20:54:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:24,627 INFO L471 AbstractCegarLoop]: Abstraction has 27841 states and 38424 transitions. [2024-10-12 20:54:24,627 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:54:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 27841 states and 38424 transitions. [2024-10-12 20:54:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 20:54:24,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:24,661 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:54:24,679 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:54:24,861 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:54:24,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:24,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash -782339540, now seen corresponding path program 1 times [2024-10-12 20:54:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:24,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338510875] [2024-10-12 20:54:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 20:54:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 20:54:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:54:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:54:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,984 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:54:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338510875] [2024-10-12 20:54:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338510875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584776777] [2024-10-12 20:54:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:24,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:24,986 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:54:24,988 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:54:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:25,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:25,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:25,111 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:54:25,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584776777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:25,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385218842] [2024-10-12 20:54:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:25,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:25,113 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:54:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:27,646 INFO L93 Difference]: Finished difference Result 75539 states and 103548 transitions. [2024-10-12 20:54:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:27,647 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:54:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:27,818 INFO L225 Difference]: With dead ends: 75539 [2024-10-12 20:54:27,818 INFO L226 Difference]: Without dead ends: 49843 [2024-10-12 20:54:27,871 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:54:27,872 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:54:27,872 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:54:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49843 states. [2024-10-12 20:54:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49843 to 49841. [2024-10-12 20:54:30,944 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:54:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49841 states to 49841 states and 68436 transitions. [2024-10-12 20:54:31,067 INFO L78 Accepts]: Start accepts. Automaton has 49841 states and 68436 transitions. Word has length 144 [2024-10-12 20:54:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:31,068 INFO L471 AbstractCegarLoop]: Abstraction has 49841 states and 68436 transitions. [2024-10-12 20:54:31,068 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:54:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 49841 states and 68436 transitions. [2024-10-12 20:54:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 20:54:31,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:31,112 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:54:31,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 20:54:31,313 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:54:31,313 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:31,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -873894743, now seen corresponding path program 1 times [2024-10-12 20:54:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33094805] [2024-10-12 20:54:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 20:54:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:54:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:54:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 20:54:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 20:54:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 20:54:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 20:54:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 20:54:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,435 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:54:31,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33094805] [2024-10-12 20:54:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33094805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422898317] [2024-10-12 20:54:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:31,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:31,438 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:54:31,440 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:54:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 20:54:31,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:31,597 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:54:31,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422898317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:31,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:54:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889249118] [2024-10-12 20:54:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:31,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:31,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:31,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:31,601 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)