./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_label43+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.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 b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:24:24,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:24:24,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:24:24,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:24:24,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:24:24,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:24:24,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:24:24,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:24:24,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:24:24,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:24:24,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:24:24,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:24:24,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:24:24,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:24:24,864 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:24:24,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:24:24,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:24:24,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:24:24,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:24:24,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:24:24,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:24:24,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:24:24,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:24:24,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:24:24,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:24:24,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:24:24,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:24:24,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:24:24,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:24:24,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:24:24,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:24:24,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:24:24,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:24:24,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:24:24,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:24:24,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:24:24,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:24:24,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:24:24,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:24:24,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:24:24,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:24:24,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:24:24,880 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 -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2024-10-14 04:24:25,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:24:25,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:24:25,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:24:25,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:24:25,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:24:25,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-10-14 04:24:26,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:24:27,409 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:24:27,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-10-14 04:24:27,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a33c0f/0fc580c7c1ec4a828ac28fb581e01f03/FLAGdecabe514 [2024-10-14 04:24:27,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a84a33c0f/0fc580c7c1ec4a828ac28fb581e01f03 [2024-10-14 04:24:27,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:24:27,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:24:27,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:24:27,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:24:27,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:24:27,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:24:27" (1/1) ... [2024-10-14 04:24:27,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50eda27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:27, skipping insertion in model container [2024-10-14 04:24:27,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:24:27" (1/1) ... [2024-10-14 04:24:28,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:24:29,918 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_label43+token_ring.01.cil-2.c[381679,381692] [2024-10-14 04:24:29,950 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_label43+token_ring.01.cil-2.c[383339,383352] [2024-10-14 04:24:30,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:24:30,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:24:30,891 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_label43+token_ring.01.cil-2.c[381679,381692] [2024-10-14 04:24:30,895 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_label43+token_ring.01.cil-2.c[383339,383352] [2024-10-14 04:24:30,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:24:30,956 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:24:30,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30 WrapperNode [2024-10-14 04:24:30,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:24:30,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:24:30,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:24:30,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:24:30,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,508 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2024-10-14 04:24:31,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:24:31,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:24:31,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:24:31,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:24:31,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,737 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-14 04:24:31,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:31,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:32,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:32,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:24:32,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:24:32,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:24:32,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:24:32,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (1/1) ... [2024-10-14 04:24:32,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:24:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:32,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:24:32,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:24:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:24:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-14 04:24:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-14 04:24:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:24:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:24:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:24:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:24:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:24:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:24:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:24:32,198 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:24:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:24:32,199 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:24:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:24:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:24:32,199 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:24:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:24:32,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:24:32,311 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:24:32,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:24:39,775 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-10-14 04:24:39,775 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:24:39,880 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:24:39,881 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 04:24:39,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:24:39 BoogieIcfgContainer [2024-10-14 04:24:39,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:24:39,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:24:39,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:24:39,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:24:39,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:24:27" (1/3) ... [2024-10-14 04:24:39,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3804afcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:24:39, skipping insertion in model container [2024-10-14 04:24:39,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:24:30" (2/3) ... [2024-10-14 04:24:39,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3804afcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:24:39, skipping insertion in model container [2024-10-14 04:24:39,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:24:39" (3/3) ... [2024-10-14 04:24:39,890 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.01.cil-2.c [2024-10-14 04:24:39,906 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:24:39,906 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:24:40,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:24:40,035 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;@17838871, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:24:40,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:24:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-14 04:24:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 04:24:40,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:40,076 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] [2024-10-14 04:24:40,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash -365934265, now seen corresponding path program 1 times [2024-10-14 04:24:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:40,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312006893] [2024-10-14 04:24:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:40,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:24:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312006893] [2024-10-14 04:24:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312006893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:40,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:24:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002413273] [2024-10-14 04:24:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:40,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:24:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:24:40,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:40,639 INFO L87 Difference]: Start difference. First operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:41,502 INFO L93 Difference]: Finished difference Result 4576 states and 8569 transitions. [2024-10-14 04:24:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:24:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-14 04:24:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:41,542 INFO L225 Difference]: With dead ends: 4576 [2024-10-14 04:24:41,542 INFO L226 Difference]: Without dead ends: 2351 [2024-10-14 04:24:41,555 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-14 04:24:41,558 INFO L432 NwaCegarLoop]: 4051 mSDtfsCounter, 4257 mSDsluCounter, 12127 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 16178 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:41,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 16178 Invalid, 531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 04:24:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2024-10-14 04:24:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2024-10-14 04:24:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.843915343915344) internal successors, (4182), 2272 states have internal predecessors, (4182), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-14 04:24:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4237 transitions. [2024-10-14 04:24:41,715 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4237 transitions. Word has length 52 [2024-10-14 04:24:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4237 transitions. [2024-10-14 04:24:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4237 transitions. [2024-10-14 04:24:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 04:24:41,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:41,721 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] [2024-10-14 04:24:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:24:41,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 101066947, now seen corresponding path program 1 times [2024-10-14 04:24:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:41,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611553017] [2024-10-14 04:24:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:24:41,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611553017] [2024-10-14 04:24:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611553017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365808877] [2024-10-14 04:24:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:41,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:41,927 INFO L87 Difference]: Start difference. First operand 2310 states and 4237 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:42,861 INFO L93 Difference]: Finished difference Result 2639 states and 4723 transitions. [2024-10-14 04:24:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:24:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-14 04:24:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:42,879 INFO L225 Difference]: With dead ends: 2639 [2024-10-14 04:24:42,880 INFO L226 Difference]: Without dead ends: 2457 [2024-10-14 04:24:42,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:24:42,884 INFO L432 NwaCegarLoop]: 4113 mSDtfsCounter, 4241 mSDsluCounter, 16292 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20405 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:42,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20405 Invalid, 800 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [43 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 04:24:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2024-10-14 04:24:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2394. [2024-10-14 04:24:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2335 states have (on average 1.833404710920771) internal successors, (4281), 2340 states have internal predecessors, (4281), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-14 04:24:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4358 transitions. [2024-10-14 04:24:42,971 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4358 transitions. Word has length 52 [2024-10-14 04:24:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:42,971 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 4358 transitions. [2024-10-14 04:24:42,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4358 transitions. [2024-10-14 04:24:42,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 04:24:42,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:42,974 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] [2024-10-14 04:24:42,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:24:42,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash 524713669, now seen corresponding path program 1 times [2024-10-14 04:24:42,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:42,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703581894] [2024-10-14 04:24:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:42,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:24:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703581894] [2024-10-14 04:24:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703581894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964990358] [2024-10-14 04:24:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:43,122 INFO L87 Difference]: Start difference. First operand 2394 states and 4358 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:44,064 INFO L93 Difference]: Finished difference Result 2964 states and 5194 transitions. [2024-10-14 04:24:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:24:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-14 04:24:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:44,081 INFO L225 Difference]: With dead ends: 2964 [2024-10-14 04:24:44,081 INFO L226 Difference]: Without dead ends: 2698 [2024-10-14 04:24:44,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:24:44,089 INFO L432 NwaCegarLoop]: 4109 mSDtfsCounter, 4288 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 20396 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:44,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4298 Valid, 20396 Invalid, 791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 04:24:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2024-10-14 04:24:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2559. [2024-10-14 04:24:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2468 states have (on average 1.8144246353322528) internal successors, (4478), 2475 states have internal predecessors, (4478), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-10-14 04:24:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4599 transitions. [2024-10-14 04:24:44,203 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4599 transitions. Word has length 52 [2024-10-14 04:24:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:44,204 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4599 transitions. [2024-10-14 04:24:44,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4599 transitions. [2024-10-14 04:24:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 04:24:44,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:44,209 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] [2024-10-14 04:24:44,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:24:44,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:44,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash -847093629, now seen corresponding path program 1 times [2024-10-14 04:24:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004651333] [2024-10-14 04:24:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:24:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004651333] [2024-10-14 04:24:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004651333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:44,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:24:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605947146] [2024-10-14 04:24:44,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:44,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:24:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:24:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:44,356 INFO L87 Difference]: Start difference. First operand 2559 states and 4599 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:45,294 INFO L93 Difference]: Finished difference Result 3480 states and 5949 transitions. [2024-10-14 04:24:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:24:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-14 04:24:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:45,310 INFO L225 Difference]: With dead ends: 3480 [2024-10-14 04:24:45,310 INFO L226 Difference]: Without dead ends: 3049 [2024-10-14 04:24:45,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:24:45,314 INFO L432 NwaCegarLoop]: 4098 mSDtfsCounter, 4235 mSDsluCounter, 16272 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4242 SdHoareTripleChecker+Valid, 20370 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:45,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4242 Valid, 20370 Invalid, 817 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 04:24:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2024-10-14 04:24:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2840. [2024-10-14 04:24:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2691 states have (on average 1.7822370865849126) internal successors, (4796), 2702 states have internal predecessors, (4796), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-10-14 04:24:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5003 transitions. [2024-10-14 04:24:45,465 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5003 transitions. Word has length 52 [2024-10-14 04:24:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:45,467 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 5003 transitions. [2024-10-14 04:24:45,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5003 transitions. [2024-10-14 04:24:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 04:24:45,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:45,472 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] [2024-10-14 04:24:45,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:24:45,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1602506501, now seen corresponding path program 1 times [2024-10-14 04:24:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793465066] [2024-10-14 04:24:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:45,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:24:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793465066] [2024-10-14 04:24:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793465066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:24:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876978667] [2024-10-14 04:24:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:45,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:24:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:24:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:45,581 INFO L87 Difference]: Start difference. First operand 2840 states and 5003 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:46,334 INFO L93 Difference]: Finished difference Result 4114 states and 6859 transitions. [2024-10-14 04:24:46,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:24:46,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-10-14 04:24:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:46,357 INFO L225 Difference]: With dead ends: 4114 [2024-10-14 04:24:46,357 INFO L226 Difference]: Without dead ends: 3403 [2024-10-14 04:24:46,362 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-14 04:24:46,366 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4346 mSDsluCounter, 12122 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 16239 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:46,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 16239 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 04:24:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2024-10-14 04:24:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3212. [2024-10-14 04:24:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2980 states have (on average 1.7426174496644296) internal successors, (5193), 3000 states have internal predecessors, (5193), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-10-14 04:24:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5508 transitions. [2024-10-14 04:24:46,496 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5508 transitions. Word has length 52 [2024-10-14 04:24:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:46,496 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 5508 transitions. [2024-10-14 04:24:46,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:24:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5508 transitions. [2024-10-14 04:24:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 04:24:46,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:46,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:24:46,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:24:46,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:46,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash -179544944, now seen corresponding path program 1 times [2024-10-14 04:24:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855164384] [2024-10-14 04:24:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 04:24:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 04:24:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 04:24:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855164384] [2024-10-14 04:24:46,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855164384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427116623] [2024-10-14 04:24:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:46,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:46,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:46,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:46,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 04:24:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:46,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:24:46,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 04:24:46,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427116623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:46,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 04:24:46,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410709471] [2024-10-14 04:24:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:46,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:46,766 INFO L87 Difference]: Start difference. First operand 3212 states and 5508 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:46,933 INFO L93 Difference]: Finished difference Result 5267 states and 8483 transitions. [2024-10-14 04:24:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:24:46,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2024-10-14 04:24:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:46,956 INFO L225 Difference]: With dead ends: 5267 [2024-10-14 04:24:46,957 INFO L226 Difference]: Without dead ends: 4185 [2024-10-14 04:24:46,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:46,965 INFO L432 NwaCegarLoop]: 4194 mSDtfsCounter, 107 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:46,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 8282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2024-10-14 04:24:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2024-10-14 04:24:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3744 states have (on average 1.670405982905983) internal successors, (6254), 3777 states have internal predecessors, (6254), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2024-10-14 04:24:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6885 transitions. [2024-10-14 04:24:47,156 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6885 transitions. Word has length 84 [2024-10-14 04:24:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:47,157 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 6885 transitions. [2024-10-14 04:24:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6885 transitions. [2024-10-14 04:24:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 04:24:47,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:47,164 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:47,186 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-14 04:24:47,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 04:24:47,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:47,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash 20714924, now seen corresponding path program 1 times [2024-10-14 04:24:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101093956] [2024-10-14 04:24:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 04:24:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 04:24:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:24:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 04:24:47,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101093956] [2024-10-14 04:24:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101093956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:47,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173102254] [2024-10-14 04:24:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:47,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:47,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:47,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:47,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 04:24:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:47,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:24:47,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 04:24:47,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173102254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 04:24:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000968076] [2024-10-14 04:24:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:47,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:47,736 INFO L87 Difference]: Start difference. First operand 4185 states and 6885 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 04:24:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:48,043 INFO L93 Difference]: Finished difference Result 8169 states and 12572 transitions. [2024-10-14 04:24:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:24:48,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-10-14 04:24:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:48,086 INFO L225 Difference]: With dead ends: 8169 [2024-10-14 04:24:48,087 INFO L226 Difference]: Without dead ends: 6117 [2024-10-14 04:24:48,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:48,098 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4036 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:48,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 4229 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:48,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2024-10-14 04:24:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 6085. [2024-10-14 04:24:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 5250 states have (on average 1.5895238095238096) internal successors, (8345), 5312 states have internal predecessors, (8345), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2024-10-14 04:24:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9508 transitions. [2024-10-14 04:24:48,377 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9508 transitions. Word has length 107 [2024-10-14 04:24:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:48,377 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 9508 transitions. [2024-10-14 04:24:48,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 04:24:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9508 transitions. [2024-10-14 04:24:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 04:24:48,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:48,388 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:48,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 04:24:48,588 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,SelfDestructingSolverStorable6 [2024-10-14 04:24:48,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:48,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1514455832, now seen corresponding path program 1 times [2024-10-14 04:24:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440026486] [2024-10-14 04:24:48,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 04:24:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 04:24:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 04:24:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:24:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-14 04:24:48,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:48,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440026486] [2024-10-14 04:24:48,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440026486] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:48,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170844275] [2024-10-14 04:24:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:48,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:48,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:48,723 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:48,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 04:24:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:48,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 04:24:48,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 04:24:48,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170844275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:48,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:48,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 04:24:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626096192] [2024-10-14 04:24:48,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:48,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:48,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:48,885 INFO L87 Difference]: Start difference. First operand 6085 states and 9508 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 04:24:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:49,135 INFO L93 Difference]: Finished difference Result 9149 states and 13829 transitions. [2024-10-14 04:24:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:24:49,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2024-10-14 04:24:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:49,163 INFO L225 Difference]: With dead ends: 9149 [2024-10-14 04:24:49,163 INFO L226 Difference]: Without dead ends: 6373 [2024-10-14 04:24:49,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:49,176 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4052 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:49,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 4235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2024-10-14 04:24:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6335. [2024-10-14 04:24:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5468 states have (on average 1.5652889539136796) internal successors, (8559), 5530 states have internal predecessors, (8559), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2024-10-14 04:24:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9760 transitions. [2024-10-14 04:24:49,598 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9760 transitions. Word has length 122 [2024-10-14 04:24:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:49,599 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9760 transitions. [2024-10-14 04:24:49,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 04:24:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9760 transitions. [2024-10-14 04:24:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 04:24:49,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:49,610 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:49,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 04:24:49,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:49,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:49,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -444169551, now seen corresponding path program 1 times [2024-10-14 04:24:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:49,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241393274] [2024-10-14 04:24:49,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:49,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 04:24:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 04:24:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 04:24:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 04:24:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-14 04:24:49,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:49,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241393274] [2024-10-14 04:24:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241393274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:49,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64301470] [2024-10-14 04:24:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:49,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:49,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:49,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:49,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 04:24:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:50,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:24:50,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 04:24:50,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64301470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 04:24:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92730113] [2024-10-14 04:24:50,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:50,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:50,075 INFO L87 Difference]: Start difference. First operand 6335 states and 9760 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 04:24:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:50,495 INFO L93 Difference]: Finished difference Result 14423 states and 21066 transitions. [2024-10-14 04:24:50,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:24:50,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2024-10-14 04:24:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:50,544 INFO L225 Difference]: With dead ends: 14423 [2024-10-14 04:24:50,545 INFO L226 Difference]: Without dead ends: 10223 [2024-10-14 04:24:50,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:50,565 INFO L432 NwaCegarLoop]: 4193 mSDtfsCounter, 120 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:50,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8282 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10223 states. [2024-10-14 04:24:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10223 to 10207. [2024-10-14 04:24:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 8526 states have (on average 1.4828759089842833) internal successors, (12643), 8648 states have internal predecessors, (12643), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-14 04:24:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 15120 transitions. [2024-10-14 04:24:51,281 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 15120 transitions. Word has length 123 [2024-10-14 04:24:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:51,282 INFO L471 AbstractCegarLoop]: Abstraction has 10207 states and 15120 transitions. [2024-10-14 04:24:51,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 04:24:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 15120 transitions. [2024-10-14 04:24:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 04:24:51,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:51,302 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:51,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 04:24:51,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:51,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:51,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:51,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1006490321, now seen corresponding path program 1 times [2024-10-14 04:24:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232939882] [2024-10-14 04:24:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 04:24:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-14 04:24:51,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:51,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232939882] [2024-10-14 04:24:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232939882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591527802] [2024-10-14 04:24:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:51,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:51,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:51,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:51,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 04:24:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:51,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 04:24:51,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 04:24:51,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591527802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 04:24:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906273248] [2024-10-14 04:24:51,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:51,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:51,792 INFO L87 Difference]: Start difference. First operand 10207 states and 15120 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 04:24:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:52,532 INFO L93 Difference]: Finished difference Result 14381 states and 21212 transitions. [2024-10-14 04:24:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:24:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2024-10-14 04:24:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:52,572 INFO L225 Difference]: With dead ends: 14381 [2024-10-14 04:24:52,572 INFO L226 Difference]: Without dead ends: 10227 [2024-10-14 04:24:52,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:52,585 INFO L432 NwaCegarLoop]: 4160 mSDtfsCounter, 106 mSDsluCounter, 4083 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:52,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 8243 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2024-10-14 04:24:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 10183. [2024-10-14 04:24:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10183 states, 8502 states have (on average 1.4687132439426018) internal successors, (12487), 8624 states have internal predecessors, (12487), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-14 04:24:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14964 transitions. [2024-10-14 04:24:53,079 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14964 transitions. Word has length 124 [2024-10-14 04:24:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:53,079 INFO L471 AbstractCegarLoop]: Abstraction has 10183 states and 14964 transitions. [2024-10-14 04:24:53,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 04:24:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14964 transitions. [2024-10-14 04:24:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 04:24:53,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:53,096 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:53,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 04:24:53,300 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,SelfDestructingSolverStorable9 [2024-10-14 04:24:53,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:53,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1898602929, now seen corresponding path program 1 times [2024-10-14 04:24:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608636160] [2024-10-14 04:24:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:53,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 04:24:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-14 04:24:53,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:53,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608636160] [2024-10-14 04:24:53,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608636160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:53,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161148292] [2024-10-14 04:24:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:53,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:53,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:53,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 04:24:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:53,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 04:24:53,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 04:24:53,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161148292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 04:24:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320810182] [2024-10-14 04:24:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 04:24:53,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 04:24:53,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:53,538 INFO L87 Difference]: Start difference. First operand 10183 states and 14964 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 04:24:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:53,909 INFO L93 Difference]: Finished difference Result 16127 states and 23370 transitions. [2024-10-14 04:24:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 04:24:53,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2024-10-14 04:24:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:53,957 INFO L225 Difference]: With dead ends: 16127 [2024-10-14 04:24:53,957 INFO L226 Difference]: Without dead ends: 9051 [2024-10-14 04:24:53,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:24:53,986 INFO L432 NwaCegarLoop]: 4092 mSDtfsCounter, 4081 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:53,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2024-10-14 04:24:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 8643. [2024-10-14 04:24:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 7288 states have (on average 1.4523874862788144) internal successors, (10585), 7378 states have internal predecessors, (10585), 755 states have call successors, (755), 535 states have call predecessors, (755), 598 states have return successors, (1098), 745 states have call predecessors, (1098), 753 states have call successors, (1098) [2024-10-14 04:24:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 12438 transitions. [2024-10-14 04:24:54,498 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 12438 transitions. Word has length 124 [2024-10-14 04:24:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:54,499 INFO L471 AbstractCegarLoop]: Abstraction has 8643 states and 12438 transitions. [2024-10-14 04:24:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 04:24:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 12438 transitions. [2024-10-14 04:24:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 04:24:54,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:54,512 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:54,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 04:24:54,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:54,713 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:54,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash -315841116, now seen corresponding path program 1 times [2024-10-14 04:24:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748638151] [2024-10-14 04:24:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:24:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-14 04:24:54,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:54,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748638151] [2024-10-14 04:24:54,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748638151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936061160] [2024-10-14 04:24:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:54,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:54,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:54,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:54,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 04:24:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:54,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 04:24:54,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 04:24:55,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936061160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-14 04:24:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175118777] [2024-10-14 04:24:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:55,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:24:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:55,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:24:55,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 04:24:55,026 INFO L87 Difference]: Start difference. First operand 8643 states and 12438 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:55,465 INFO L93 Difference]: Finished difference Result 11183 states and 15869 transitions. [2024-10-14 04:24:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:24:55,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-14 04:24:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:55,496 INFO L225 Difference]: With dead ends: 11183 [2024-10-14 04:24:55,496 INFO L226 Difference]: Without dead ends: 6959 [2024-10-14 04:24:55,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 04:24:55,511 INFO L432 NwaCegarLoop]: 4044 mSDtfsCounter, 4099 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 12088 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:55,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 12088 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 04:24:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2024-10-14 04:24:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6935. [2024-10-14 04:24:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 5938 states have (on average 1.469013135735938) internal successors, (8723), 5992 states have internal predecessors, (8723), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2024-10-14 04:24:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10056 transitions. [2024-10-14 04:24:55,818 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10056 transitions. Word has length 125 [2024-10-14 04:24:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:55,819 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 10056 transitions. [2024-10-14 04:24:55,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10056 transitions. [2024-10-14 04:24:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 04:24:55,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:55,826 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:55,844 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-14 04:24:56,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:56,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:56,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1934816030, now seen corresponding path program 1 times [2024-10-14 04:24:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112224407] [2024-10-14 04:24:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:24:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-14 04:24:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112224407] [2024-10-14 04:24:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112224407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959581178] [2024-10-14 04:24:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:56,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:56,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:56,128 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-14 04:24:56,130 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-14 04:24:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:56,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 04:24:56,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 04:24:56,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959581178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:56,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-14 04:24:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288074631] [2024-10-14 04:24:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:56,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:24:56,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:56,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:24:56,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 04:24:56,300 INFO L87 Difference]: Start difference. First operand 6935 states and 10056 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:56,865 INFO L93 Difference]: Finished difference Result 10847 states and 15238 transitions. [2024-10-14 04:24:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:24:56,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-14 04:24:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:56,891 INFO L225 Difference]: With dead ends: 10847 [2024-10-14 04:24:56,891 INFO L226 Difference]: Without dead ends: 6579 [2024-10-14 04:24:56,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:24:56,903 INFO L432 NwaCegarLoop]: 4042 mSDtfsCounter, 4129 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 12082 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:56,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 12082 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:24:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2024-10-14 04:24:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4985. [2024-10-14 04:24:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 4408 states have (on average 1.5181488203266789) internal successors, (6692), 4438 states have internal predecessors, (6692), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2024-10-14 04:24:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7462 transitions. [2024-10-14 04:24:57,157 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7462 transitions. Word has length 125 [2024-10-14 04:24:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:57,158 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 7462 transitions. [2024-10-14 04:24:57,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7462 transitions. [2024-10-14 04:24:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 04:24:57,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:57,163 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:57,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 04:24:57,367 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,SelfDestructingSolverStorable12 [2024-10-14 04:24:57,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:57,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1476642276, now seen corresponding path program 1 times [2024-10-14 04:24:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341364349] [2024-10-14 04:24:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:57,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:24:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-14 04:24:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341364349] [2024-10-14 04:24:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341364349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61719482] [2024-10-14 04:24:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:57,492 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-14 04:24:57,494 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-14 04:24:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:57,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 04:24:57,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-14 04:24:57,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61719482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-14 04:24:57,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227606154] [2024-10-14 04:24:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:24:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:57,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:24:57,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:57,603 INFO L87 Difference]: Start difference. First operand 4985 states and 7462 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:57,796 INFO L93 Difference]: Finished difference Result 6815 states and 9762 transitions. [2024-10-14 04:24:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:24:57,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-14 04:24:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:57,814 INFO L225 Difference]: With dead ends: 6815 [2024-10-14 04:24:57,814 INFO L226 Difference]: Without dead ends: 3962 [2024-10-14 04:24:57,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:57,824 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 0 mSDsluCounter, 8163 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12247 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:57,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12247 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-10-14 04:24:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2024-10-14 04:24:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3595 states have (on average 1.5794158553546593) internal successors, (5678), 3613 states have internal predecessors, (5678), 209 states have call successors, (209), 147 states have call predecessors, (209), 156 states have return successors, (250), 203 states have call predecessors, (250), 207 states have call successors, (250) [2024-10-14 04:24:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 6137 transitions. [2024-10-14 04:24:57,991 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 6137 transitions. Word has length 125 [2024-10-14 04:24:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:57,991 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 6137 transitions. [2024-10-14 04:24:57,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 6137 transitions. [2024-10-14 04:24:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 04:24:57,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:57,997 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 04:24:58,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 04:24:58,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 04:24:58,197 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:58,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash -985130332, now seen corresponding path program 1 times [2024-10-14 04:24:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903177918] [2024-10-14 04:24:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:24:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 04:24:58,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:58,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903177918] [2024-10-14 04:24:58,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903177918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 04:24:58,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137479880] [2024-10-14 04:24:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:58,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 04:24:58,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:24:58,371 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 04:24:58,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 04:24:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:58,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 04:24:58,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 04:24:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 04:24:58,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 04:24:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137479880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:58,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 04:24:58,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-14 04:24:58,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713981999] [2024-10-14 04:24:58,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:58,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 04:24:58,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 04:24:58,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:58,482 INFO L87 Difference]: Start difference. First operand 3962 states and 6137 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:58,641 INFO L93 Difference]: Finished difference Result 5053 states and 7447 transitions. [2024-10-14 04:24:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 04:24:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-14 04:24:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:58,654 INFO L225 Difference]: With dead ends: 5053 [2024-10-14 04:24:58,655 INFO L226 Difference]: Without dead ends: 2852 [2024-10-14 04:24:58,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:58,660 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 0 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:58,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12244 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 04:24:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2024-10-14 04:24:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2024-10-14 04:24:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2704 states have (on average 1.7082100591715976) internal successors, (4619), 2713 states have internal predecessors, (4619), 85 states have call successors, (85), 58 states have call predecessors, (85), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-14 04:24:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4791 transitions. [2024-10-14 04:24:58,744 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4791 transitions. Word has length 125 [2024-10-14 04:24:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:58,744 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4791 transitions. [2024-10-14 04:24:58,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:24:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4791 transitions. [2024-10-14 04:24:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 04:24:58,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:58,746 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, 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-14 04:24:58,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 04:24:58,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 04:24:58,947 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:58,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -88102940, now seen corresponding path program 1 times [2024-10-14 04:24:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052138922] [2024-10-14 04:24:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:24:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-14 04:24:59,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:59,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052138922] [2024-10-14 04:24:59,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052138922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:59,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:59,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:24:59,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724986147] [2024-10-14 04:24:59,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:59,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:24:59,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:24:59,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:24:59,089 INFO L87 Difference]: Start difference. First operand 2852 states and 4791 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 04:24:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:24:59,591 INFO L93 Difference]: Finished difference Result 2874 states and 4812 transitions. [2024-10-14 04:24:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:24:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2024-10-14 04:24:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:24:59,606 INFO L225 Difference]: With dead ends: 2874 [2024-10-14 04:24:59,606 INFO L226 Difference]: Without dead ends: 2871 [2024-10-14 04:24:59,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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-14 04:24:59,608 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 4294 mSDsluCounter, 12093 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 16177 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:24:59,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 16177 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 04:24:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2024-10-14 04:24:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2851. [2024-10-14 04:24:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2704 states have (on average 1.7074704142011834) internal successors, (4617), 2712 states have internal predecessors, (4617), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-14 04:24:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4788 transitions. [2024-10-14 04:24:59,706 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4788 transitions. Word has length 125 [2024-10-14 04:24:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:24:59,707 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 4788 transitions. [2024-10-14 04:24:59,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-14 04:24:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4788 transitions. [2024-10-14 04:24:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 04:24:59,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:24:59,709 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, 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-14 04:24:59,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 04:24:59,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:24:59,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:24:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1275818764, now seen corresponding path program 1 times [2024-10-14 04:24:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:24:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685337123] [2024-10-14 04:24:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:24:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:24:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:24:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 04:24:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:24:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 04:24:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 04:24:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 04:24:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 04:24:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:24:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 04:24:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:24:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:24:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-14 04:24:59,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:24:59,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685337123] [2024-10-14 04:24:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685337123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:24:59,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:24:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:24:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205777186] [2024-10-14 04:24:59,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:24:59,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:24:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:24:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:24:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:24:59,857 INFO L87 Difference]: Start difference. First operand 2851 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:25:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:25:00,163 INFO L93 Difference]: Finished difference Result 3238 states and 5230 transitions. [2024-10-14 04:25:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:25:00,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2024-10-14 04:25:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:25:00,172 INFO L225 Difference]: With dead ends: 3238 [2024-10-14 04:25:00,172 INFO L226 Difference]: Without dead ends: 2873 [2024-10-14 04:25:00,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:25:00,175 INFO L432 NwaCegarLoop]: 4041 mSDtfsCounter, 90 mSDsluCounter, 12024 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 16065 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:25:00,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 16065 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 04:25:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-14 04:25:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2853. [2024-10-14 04:25:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2706 states have (on average 1.7069475240206948) internal successors, (4619), 2714 states have internal predecessors, (4619), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-14 04:25:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4790 transitions. [2024-10-14 04:25:00,321 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4790 transitions. Word has length 129 [2024-10-14 04:25:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:25:00,322 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4790 transitions. [2024-10-14 04:25:00,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 04:25:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4790 transitions. [2024-10-14 04:25:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 04:25:00,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:25:00,325 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, 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, 1] [2024-10-14 04:25:00,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 04:25:00,325 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:25:00,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:25:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2124916191, now seen corresponding path program 1 times [2024-10-14 04:25:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:25:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987606723] [2024-10-14 04:25:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:25:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:25:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:25:00,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 04:25:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:25:00,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 04:25:00,399 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 04:25:00,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-14 04:25:00,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-14 04:25:00,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 04:25:00,408 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:25:00,514 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 04:25:00,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:25:00 BoogieIcfgContainer [2024-10-14 04:25:00,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 04:25:00,518 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 04:25:00,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 04:25:00,518 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 04:25:00,519 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:24:39" (3/4) ... [2024-10-14 04:25:00,519 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 04:25:00,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 04:25:00,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 04:25:00,633 INFO L158 Benchmark]: Toolchain (without parser) took 32813.52ms. Allocated memory was 159.4MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 70.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. [2024-10-14 04:25:00,633 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 04:25:00,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3136.40ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 70.4MB in the beginning and 119.5MB in the end (delta: -49.1MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. [2024-10-14 04:25:00,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 551.14ms. Allocated memory was 251.7MB in the beginning and 448.8MB in the end (delta: 197.1MB). Free memory was 119.5MB in the beginning and 305.1MB in the end (delta: -185.6MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2024-10-14 04:25:00,634 INFO L158 Benchmark]: Boogie Preprocessor took 593.58ms. Allocated memory is still 448.8MB. Free memory was 305.1MB in the beginning and 238.0MB in the end (delta: 67.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-14 04:25:00,634 INFO L158 Benchmark]: RCFGBuilder took 7777.28ms. Allocated memory was 448.8MB in the beginning and 757.1MB in the end (delta: 308.3MB). Free memory was 238.0MB in the beginning and 448.8MB in the end (delta: -210.8MB). Peak memory consumption was 353.4MB. Max. memory is 16.1GB. [2024-10-14 04:25:00,635 INFO L158 Benchmark]: TraceAbstraction took 20634.53ms. Allocated memory was 757.1MB in the beginning and 2.7GB in the end (delta: 1.9GB). Free memory was 447.7MB in the beginning and 2.3GB in the end (delta: -1.8GB). Peak memory consumption was 107.6MB. Max. memory is 16.1GB. [2024-10-14 04:25:00,635 INFO L158 Benchmark]: Witness Printer took 114.39ms. Allocated memory is still 2.7GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 04:25:00,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3136.40ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 70.4MB in the beginning and 119.5MB in the end (delta: -49.1MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 551.14ms. Allocated memory was 251.7MB in the beginning and 448.8MB in the end (delta: 197.1MB). Free memory was 119.5MB in the beginning and 305.1MB in the end (delta: -185.6MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 593.58ms. Allocated memory is still 448.8MB. Free memory was 305.1MB in the beginning and 238.0MB in the end (delta: 67.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * RCFGBuilder took 7777.28ms. Allocated memory was 448.8MB in the beginning and 757.1MB in the end (delta: 308.3MB). Free memory was 238.0MB in the beginning and 448.8MB in the end (delta: -210.8MB). Peak memory consumption was 353.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20634.53ms. Allocated memory was 757.1MB in the beginning and 2.7GB in the end (delta: 1.9GB). Free memory was 447.7MB in the beginning and 2.3GB in the end (delta: -1.8GB). Peak memory consumption was 107.6MB. Max. memory is 16.1GB. * Witness Printer took 114.39ms. Allocated memory is still 2.7GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11118]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46577 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46481 mSDsluCounter, 211874 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142147 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4485 IncrementalHoareTripleChecker+Invalid, 4912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 69727 mSDtfsCounter, 4485 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10207occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2839 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3012 NumberOfCodeBlocks, 3012 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2855 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3998 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1310/1466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 04:25:00,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE