./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_label47+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e29588631802f33e276df8c8a4376435a271a426c8b5d54fd1eb814b142c7499 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:23:54,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:23:54,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:23:54,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:23:54,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:23:54,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:23:54,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:23:54,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:23:54,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:23:54,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:23:54,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:23:54,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:23:54,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:23:54,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:23:54,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:23:54,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:23:54,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:23:54,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:23:54,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:23:54,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:23:54,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:23:54,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:23:54,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:23:54,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:23:54,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:23:54,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:23:54,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:23:54,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:23:54,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:23:54,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:23:54,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:23:54,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:23:54,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:23:54,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:23:54,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:23:54,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:23:54,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:23:54,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:23:54,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:23:54,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:23:54,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:23:54,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:23:54,882 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-clean/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-clean/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 -> e29588631802f33e276df8c8a4376435a271a426c8b5d54fd1eb814b142c7499 [2024-10-11 04:23:55,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:23:55,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:23:55,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:23:55,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:23:55,220 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:23:55,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c [2024-10-11 04:23:56,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:23:58,013 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:23:58,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.02.cil-1.c [2024-10-11 04:23:58,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/64edd66b0/c13a30276fa64a54bb13e681df55b8c7/FLAGb777beb7a [2024-10-11 04:23:58,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/64edd66b0/c13a30276fa64a54bb13e681df55b8c7 [2024-10-11 04:23:58,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:23:58,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:23:58,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:23:58,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:23:58,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:23:58,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:23:58" (1/1) ... [2024-10-11 04:23:58,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216fe3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:23:58, skipping insertion in model container [2024-10-11 04:23:58,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:23:58" (1/1) ... [2024-10-11 04:23:58,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:23:59,767 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_label47+token_ring.02.cil-1.c[377612,377625] [2024-10-11 04:23:59,792 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_label47+token_ring.02.cil-1.c[383339,383352] [2024-10-11 04:23:59,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:23:59,912 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:24:00,563 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_label47+token_ring.02.cil-1.c[377612,377625] [2024-10-11 04:24:00,571 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_label47+token_ring.02.cil-1.c[383339,383352] [2024-10-11 04:24:00,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:24:00,632 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:24:00,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00 WrapperNode [2024-10-11 04:24:00,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:24:00,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:00,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:24:00,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:24:00,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:00,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:00,973 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12633 [2024-10-11 04:24:00,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:00,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:24:00,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:24:00,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:24:00,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:00,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,173 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-11 04:24:01,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:24:01,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:24:01,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:24:01,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:24:01,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (1/1) ... [2024-10-11 04:24:01,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:24:01,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:01,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:24:01,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:24:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:24:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:24:01,898 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:24:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:24:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:24:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:24:01,902 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:24:01,902 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:24:01,903 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:24:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:24:01,903 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:24:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:24:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:24:01,903 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:24:01,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:24:01,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:24:02,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:24:02,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:24:09,065 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2024-10-11 04:24:09,065 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:24:09,163 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:24:09,163 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 04:24:09,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:24:09 BoogieIcfgContainer [2024-10-11 04:24:09,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:24:09,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:24:09,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:24:09,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:24:09,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:23:58" (1/3) ... [2024-10-11 04:24:09,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc54e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:24:09, skipping insertion in model container [2024-10-11 04:24:09,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:00" (2/3) ... [2024-10-11 04:24:09,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc54e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:24:09, skipping insertion in model container [2024-10-11 04:24:09,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:24:09" (3/3) ... [2024-10-11 04:24:09,173 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.02.cil-1.c [2024-10-11 04:24:09,189 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:24:09,189 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:24:09,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:24:09,304 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;@624a5a7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:24:09,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:24:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 04:24:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:24:09,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:09,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:09,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:09,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash -584044612, now seen corresponding path program 1 times [2024-10-11 04:24:09,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:09,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982636675] [2024-10-11 04:24:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:09,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:09,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:09,913 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-11 04:24:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982636675] [2024-10-11 04:24:09,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982636675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:09,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:24:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86008537] [2024-10-11 04:24:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:09,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:24:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:24:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:24:09,960 INFO L87 Difference]: Start difference. First operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:10,971 INFO L93 Difference]: Finished difference Result 4643 states and 8686 transitions. [2024-10-11 04:24:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:24:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:24:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:11,005 INFO L225 Difference]: With dead ends: 4643 [2024-10-11 04:24:11,005 INFO L226 Difference]: Without dead ends: 2404 [2024-10-11 04:24:11,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:24:11,015 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4350 mSDsluCounter, 12142 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 16199 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:11,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 16199 Invalid, 691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:24:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-10-11 04:24:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2345. [2024-10-11 04:24:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2303 states have (on average 1.84020842379505) internal successors, (4238), 2306 states have internal predecessors, (4238), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-10-11 04:24:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4295 transitions. [2024-10-11 04:24:11,186 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 4295 transitions. Word has length 61 [2024-10-11 04:24:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:11,187 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 4295 transitions. [2024-10-11 04:24:11,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 4295 transitions. [2024-10-11 04:24:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:24:11,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:11,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:11,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:24:11,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404092, now seen corresponding path program 1 times [2024-10-11 04:24:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:11,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277130879] [2024-10-11 04:24:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:11,383 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-11 04:24:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277130879] [2024-10-11 04:24:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277130879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:11,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:11,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:11,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724598352] [2024-10-11 04:24:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:11,387 INFO L87 Difference]: Start difference. First operand 2345 states and 4295 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:12,602 INFO L93 Difference]: Finished difference Result 2757 states and 4924 transitions. [2024-10-11 04:24:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:12,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:24:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:12,615 INFO L225 Difference]: With dead ends: 2757 [2024-10-11 04:24:12,615 INFO L226 Difference]: Without dead ends: 2541 [2024-10-11 04:24:12,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:24:12,618 INFO L432 NwaCegarLoop]: 4121 mSDtfsCounter, 4342 mSDsluCounter, 16314 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4351 SdHoareTripleChecker+Valid, 20435 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:12,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4351 Valid, 20435 Invalid, 1048 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:24:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2024-10-11 04:24:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2446. [2024-10-11 04:24:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2386 states have (on average 1.8281642917015926) internal successors, (4362), 2390 states have internal predecessors, (4362), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-11 04:24:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4443 transitions. [2024-10-11 04:24:12,687 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4443 transitions. Word has length 61 [2024-10-11 04:24:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:12,687 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4443 transitions. [2024-10-11 04:24:12,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4443 transitions. [2024-10-11 04:24:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:24:12,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:12,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:12,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:24:12,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:12,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1408885374, now seen corresponding path program 1 times [2024-10-11 04:24:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:12,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759878934] [2024-10-11 04:24:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:12,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:12,813 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-11 04:24:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759878934] [2024-10-11 04:24:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759878934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751023518] [2024-10-11 04:24:12,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:12,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:12,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:12,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:12,816 INFO L87 Difference]: Start difference. First operand 2446 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:13,676 INFO L93 Difference]: Finished difference Result 3115 states and 5460 transitions. [2024-10-11 04:24:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:13,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:24:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:13,689 INFO L225 Difference]: With dead ends: 3115 [2024-10-11 04:24:13,689 INFO L226 Difference]: Without dead ends: 2798 [2024-10-11 04:24:13,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:24:13,692 INFO L432 NwaCegarLoop]: 4062 mSDtfsCounter, 4378 mSDsluCounter, 16167 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 20229 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:13,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 20229 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:24:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-11 04:24:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2649. [2024-10-11 04:24:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2553 states have (on average 1.8061104582843712) internal successors, (4611), 2559 states have internal predecessors, (4611), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-11 04:24:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4744 transitions. [2024-10-11 04:24:13,764 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4744 transitions. Word has length 61 [2024-10-11 04:24:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:13,764 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 4744 transitions. [2024-10-11 04:24:13,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4744 transitions. [2024-10-11 04:24:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:24:13,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:13,766 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:13,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:24:13,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:13,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:13,767 INFO L85 PathProgramCache]: Analyzing trace with hash -946919876, now seen corresponding path program 1 times [2024-10-11 04:24:13,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:13,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934646135] [2024-10-11 04:24:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:13,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:13,886 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-11 04:24:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:13,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934646135] [2024-10-11 04:24:13,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934646135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:13,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:13,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869523321] [2024-10-11 04:24:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:13,889 INFO L87 Difference]: Start difference. First operand 2649 states and 4744 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:15,035 INFO L93 Difference]: Finished difference Result 3887 states and 6619 transitions. [2024-10-11 04:24:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:15,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:24:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:15,068 INFO L225 Difference]: With dead ends: 3887 [2024-10-11 04:24:15,068 INFO L226 Difference]: Without dead ends: 3367 [2024-10-11 04:24:15,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:15,082 INFO L432 NwaCegarLoop]: 4116 mSDtfsCounter, 4350 mSDsluCounter, 16306 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4358 SdHoareTripleChecker+Valid, 20422 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:15,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4358 Valid, 20422 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:24:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-10-11 04:24:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3033. [2024-10-11 04:24:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2869 states have (on average 1.7716974555594285) internal successors, (5083), 2879 states have internal predecessors, (5083), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2024-10-11 04:24:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 5318 transitions. [2024-10-11 04:24:15,336 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 5318 transitions. Word has length 61 [2024-10-11 04:24:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:15,339 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 5318 transitions. [2024-10-11 04:24:15,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 5318 transitions. [2024-10-11 04:24:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:24:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:15,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:15,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:24:15,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:15,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 981352826, now seen corresponding path program 1 times [2024-10-11 04:24:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680043929] [2024-10-11 04:24:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:15,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:15,558 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-11 04:24:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:15,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680043929] [2024-10-11 04:24:15,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680043929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:15,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:15,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816251729] [2024-10-11 04:24:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:15,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:15,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:15,567 INFO L87 Difference]: Start difference. First operand 3033 states and 5318 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:17,479 INFO L93 Difference]: Finished difference Result 5185 states and 8559 transitions. [2024-10-11 04:24:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:24:17,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:24:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:17,524 INFO L225 Difference]: With dead ends: 5185 [2024-10-11 04:24:17,525 INFO L226 Difference]: Without dead ends: 4281 [2024-10-11 04:24:17,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:24:17,539 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4350 mSDsluCounter, 16309 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4362 SdHoareTripleChecker+Valid, 20426 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:17,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4362 Valid, 20426 Invalid, 999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:24:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-10-11 04:24:17,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3818. [2024-10-11 04:24:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3522 states have (on average 1.7208972174900625) internal successors, (6061), 3540 states have internal predecessors, (6061), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2024-10-11 04:24:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 6510 transitions. [2024-10-11 04:24:17,948 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 6510 transitions. Word has length 61 [2024-10-11 04:24:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:17,948 INFO L471 AbstractCegarLoop]: Abstraction has 3818 states and 6510 transitions. [2024-10-11 04:24:17,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 6510 transitions. [2024-10-11 04:24:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:24:17,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:17,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:17,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:24:17,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:17,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1874839164, now seen corresponding path program 1 times [2024-10-11 04:24:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505884570] [2024-10-11 04:24:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:18,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:18,161 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-11 04:24:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505884570] [2024-10-11 04:24:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505884570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:18,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:18,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:24:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882369824] [2024-10-11 04:24:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:18,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:24:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:18,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:24:18,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:24:18,169 INFO L87 Difference]: Start difference. First operand 3818 states and 6510 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:19,964 INFO L93 Difference]: Finished difference Result 6913 states and 11211 transitions. [2024-10-11 04:24:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:24:19,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:24:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:20,022 INFO L225 Difference]: With dead ends: 6913 [2024-10-11 04:24:20,025 INFO L226 Difference]: Without dead ends: 5225 [2024-10-11 04:24:20,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:24:20,049 INFO L432 NwaCegarLoop]: 4142 mSDtfsCounter, 4472 mSDsluCounter, 12167 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 16309 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:20,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 16309 Invalid, 875 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:24:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2024-10-11 04:24:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4690. [2024-10-11 04:24:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4690 states, 4236 states have (on average 1.674929178470255) internal successors, (7095), 4271 states have internal predecessors, (7095), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-11 04:24:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 7764 transitions. [2024-10-11 04:24:20,275 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 7764 transitions. Word has length 61 [2024-10-11 04:24:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:20,276 INFO L471 AbstractCegarLoop]: Abstraction has 4690 states and 7764 transitions. [2024-10-11 04:24:20,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:24:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 7764 transitions. [2024-10-11 04:24:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:24:20,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:20,285 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:20,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:24:20,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:20,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2042674346, now seen corresponding path program 1 times [2024-10-11 04:24:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:20,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833178924] [2024-10-11 04:24:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:24:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:24:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:24:20,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833178924] [2024-10-11 04:24:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833178924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056988845] [2024-10-11 04:24:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:20,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:20,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:20,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:20,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:24:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:20,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:24:20,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:24:20,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056988845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:20,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:20,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:24:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749309816] [2024-10-11 04:24:20,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:20,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:20,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:20,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:20,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:20,857 INFO L87 Difference]: Start difference. First operand 4690 states and 7764 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:24:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:21,439 INFO L93 Difference]: Finished difference Result 9693 states and 15244 transitions. [2024-10-11 04:24:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:21,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2024-10-11 04:24:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:21,503 INFO L225 Difference]: With dead ends: 9693 [2024-10-11 04:24:21,503 INFO L226 Difference]: Without dead ends: 7133 [2024-10-11 04:24:21,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:21,524 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4092 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:21,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4254 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:24:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2024-10-11 04:24:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 7105. [2024-10-11 04:24:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 6237 states have (on average 1.6091069424402757) internal successors, (10036), 6305 states have internal predecessors, (10036), 510 states have call successors, (510), 308 states have call predecessors, (510), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2024-10-11 04:24:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 11291 transitions. [2024-10-11 04:24:21,856 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 11291 transitions. Word has length 99 [2024-10-11 04:24:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 11291 transitions. [2024-10-11 04:24:21,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:24:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 11291 transitions. [2024-10-11 04:24:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:24:21,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:21,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:21,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:24:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:22,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:22,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1877378954, now seen corresponding path program 1 times [2024-10-11 04:24:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675276391] [2024-10-11 04:24:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:24:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:24:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:24:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675276391] [2024-10-11 04:24:22,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675276391] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194754095] [2024-10-11 04:24:22,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:22,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:22,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:22,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:22,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:24:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:22,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:24:22,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:24:22,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:22,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194754095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:22,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:24:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622486157] [2024-10-11 04:24:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:22,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:22,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:22,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:22,362 INFO L87 Difference]: Start difference. First operand 7105 states and 11291 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:24:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:22,861 INFO L93 Difference]: Finished difference Result 16767 states and 25811 transitions. [2024-10-11 04:24:22,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:22,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-10-11 04:24:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:22,908 INFO L225 Difference]: With dead ends: 16767 [2024-10-11 04:24:22,908 INFO L226 Difference]: Without dead ends: 11793 [2024-10-11 04:24:22,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:22,929 INFO L432 NwaCegarLoop]: 4254 mSDtfsCounter, 145 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 8367 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:22,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 8367 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:24:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2024-10-11 04:24:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11793. [2024-10-11 04:24:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11793 states, 10112 states have (on average 1.5505340189873418) internal successors, (15679), 10229 states have internal predecessors, (15679), 975 states have call successors, (975), 608 states have call predecessors, (975), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2024-10-11 04:24:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11793 states to 11793 states and 18250 transitions. [2024-10-11 04:24:23,651 INFO L78 Accepts]: Start accepts. Automaton has 11793 states and 18250 transitions. Word has length 99 [2024-10-11 04:24:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 11793 states and 18250 transitions. [2024-10-11 04:24:23,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:24:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 11793 states and 18250 transitions. [2024-10-11 04:24:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 04:24:23,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:23,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:23,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:24:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:23,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:23,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1335572908, now seen corresponding path program 1 times [2024-10-11 04:24:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:23,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074859118] [2024-10-11 04:24:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:23,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:24:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 04:24:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 04:24:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 04:24:24,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074859118] [2024-10-11 04:24:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074859118] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644769443] [2024-10-11 04:24:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:24,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:24,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:24,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:24,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:24:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:24,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:24:24,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:24:24,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644769443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:24,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:24:24,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159987308] [2024-10-11 04:24:24,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:24,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:24,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:24,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:24,290 INFO L87 Difference]: Start difference. First operand 11793 states and 18250 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:24:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:25,545 INFO L93 Difference]: Finished difference Result 30733 states and 46555 transitions. [2024-10-11 04:24:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2024-10-11 04:24:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:25,638 INFO L225 Difference]: With dead ends: 30733 [2024-10-11 04:24:25,638 INFO L226 Difference]: Without dead ends: 21075 [2024-10-11 04:24:25,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:25,677 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4053 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4053 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:25,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4053 Valid, 4257 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:24:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2024-10-11 04:24:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 20969. [2024-10-11 04:24:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20969 states, 17708 states have (on average 1.5070589564038852) internal successors, (26687), 17939 states have internal predecessors, (26687), 1869 states have call successors, (1869), 1198 states have call predecessors, (1869), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2024-10-11 04:24:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 31594 transitions. [2024-10-11 04:24:27,545 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 31594 transitions. Word has length 127 [2024-10-11 04:24:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:27,550 INFO L471 AbstractCegarLoop]: Abstraction has 20969 states and 31594 transitions. [2024-10-11 04:24:27,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:24:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 31594 transitions. [2024-10-11 04:24:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 04:24:27,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:27,667 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:27,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:24:27,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:27,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:27,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash 791512030, now seen corresponding path program 1 times [2024-10-11 04:24:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915190602] [2024-10-11 04:24:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 04:24:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:24:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:24:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 04:24:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:24:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915190602] [2024-10-11 04:24:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915190602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613964483] [2024-10-11 04:24:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:28,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:28,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:28,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:28,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:24:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:28,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:24:28,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 04:24:28,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613964483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:28,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:24:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270911138] [2024-10-11 04:24:28,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:28,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:28,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:28,468 INFO L87 Difference]: Start difference. First operand 20969 states and 31594 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:24:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:30,089 INFO L93 Difference]: Finished difference Result 33443 states and 50451 transitions. [2024-10-11 04:24:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:30,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2024-10-11 04:24:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:30,152 INFO L225 Difference]: With dead ends: 33443 [2024-10-11 04:24:30,152 INFO L226 Difference]: Without dead ends: 18715 [2024-10-11 04:24:30,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:30,192 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4086 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:30,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 4142 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:24:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2024-10-11 04:24:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 14099. [2024-10-11 04:24:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14099 states, 12046 states have (on average 1.4857214012950357) internal successors, (17897), 12167 states have internal predecessors, (17897), 1161 states have call successors, (1161), 794 states have call predecessors, (1161), 890 states have return successors, (1648), 1153 states have call predecessors, (1648), 1161 states have call successors, (1648) [2024-10-11 04:24:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 20706 transitions. [2024-10-11 04:24:31,450 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 20706 transitions. Word has length 143 [2024-10-11 04:24:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:31,451 INFO L471 AbstractCegarLoop]: Abstraction has 14099 states and 20706 transitions. [2024-10-11 04:24:31,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:24:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 20706 transitions. [2024-10-11 04:24:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 04:24:31,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:31,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:31,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:24:31,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 04:24:31,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2075302660, now seen corresponding path program 1 times [2024-10-11 04:24:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417809326] [2024-10-11 04:24:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 04:24:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:24:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:24:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 04:24:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:24:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417809326] [2024-10-11 04:24:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417809326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:31,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999764148] [2024-10-11 04:24:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:31,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:31,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:31,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:24:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:31,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:24:31,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 04:24:32,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999764148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:24:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643434622] [2024-10-11 04:24:32,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:32,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:32,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:32,035 INFO L87 Difference]: Start difference. First operand 14099 states and 20706 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:24:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:32,824 INFO L93 Difference]: Finished difference Result 23244 states and 33469 transitions. [2024-10-11 04:24:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:32,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2024-10-11 04:24:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:32,888 INFO L225 Difference]: With dead ends: 23244 [2024-10-11 04:24:32,888 INFO L226 Difference]: Without dead ends: 14923 [2024-10-11 04:24:32,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:32,903 INFO L432 NwaCegarLoop]: 4144 mSDtfsCounter, 4079 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:32,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4289 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:24:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2024-10-11 04:24:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 14857. [2024-10-11 04:24:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14857 states, 12716 states have (on average 1.4599716892104435) internal successors, (18565), 12837 states have internal predecessors, (18565), 1183 states have call successors, (1183), 860 states have call predecessors, (1183), 956 states have return successors, (1736), 1175 states have call predecessors, (1736), 1183 states have call successors, (1736) [2024-10-11 04:24:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 21484 transitions. [2024-10-11 04:24:33,869 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 21484 transitions. Word has length 143 [2024-10-11 04:24:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:33,870 INFO L471 AbstractCegarLoop]: Abstraction has 14857 states and 21484 transitions. [2024-10-11 04:24:33,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:24:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 21484 transitions. [2024-10-11 04:24:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:24:33,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:33,895 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:33,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:24:34,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 04:24:34,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:34,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1556193784, now seen corresponding path program 1 times [2024-10-11 04:24:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:34,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182149948] [2024-10-11 04:24:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:24:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:24:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 04:24:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:24:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:24:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182149948] [2024-10-11 04:24:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182149948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965120047] [2024-10-11 04:24:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:34,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:34,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:34,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:34,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:24:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:34,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:24:34,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:24:34,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965120047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:34,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:34,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:24:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753972945] [2024-10-11 04:24:34,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:34,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:34,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:34,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:34,351 INFO L87 Difference]: Start difference. First operand 14857 states and 21484 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:24:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:35,886 INFO L93 Difference]: Finished difference Result 39509 states and 55950 transitions. [2024-10-11 04:24:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-11 04:24:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:35,988 INFO L225 Difference]: With dead ends: 39509 [2024-10-11 04:24:35,989 INFO L226 Difference]: Without dead ends: 26789 [2024-10-11 04:24:36,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:36,017 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 135 mSDsluCounter, 4111 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8363 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:36,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8363 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:24:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2024-10-11 04:24:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 26743. [2024-10-11 04:24:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26743 states, 22644 states have (on average 1.4140169581346052) internal successors, (32019), 22885 states have internal predecessors, (32019), 2245 states have call successors, (2245), 1660 states have call predecessors, (2245), 1852 states have return successors, (3798), 2229 states have call predecessors, (3798), 2245 states have call successors, (3798) [2024-10-11 04:24:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26743 states to 26743 states and 38062 transitions. [2024-10-11 04:24:38,249 INFO L78 Accepts]: Start accepts. Automaton has 26743 states and 38062 transitions. Word has length 144 [2024-10-11 04:24:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:38,250 INFO L471 AbstractCegarLoop]: Abstraction has 26743 states and 38062 transitions. [2024-10-11 04:24:38,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:24:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26743 states and 38062 transitions. [2024-10-11 04:24:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:24:38,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:38,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:38,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 04:24:38,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:24:38,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash 125794537, now seen corresponding path program 1 times [2024-10-11 04:24:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:38,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250853008] [2024-10-11 04:24:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:24:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:24:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:24:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:24:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:24:38,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:38,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250853008] [2024-10-11 04:24:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250853008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:38,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200719264] [2024-10-11 04:24:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:38,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:38,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 04:24:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:38,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:24:38,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 04:24:38,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200719264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:38,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:24:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41630821] [2024-10-11 04:24:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:38,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:38,843 INFO L87 Difference]: Start difference. First operand 26743 states and 38062 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:24:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:41,045 INFO L93 Difference]: Finished difference Result 52491 states and 75074 transitions. [2024-10-11 04:24:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:41,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2024-10-11 04:24:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:41,135 INFO L225 Difference]: With dead ends: 52491 [2024-10-11 04:24:41,136 INFO L226 Difference]: Without dead ends: 27885 [2024-10-11 04:24:41,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:41,178 INFO L432 NwaCegarLoop]: 4108 mSDtfsCounter, 4065 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:41,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 4135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:24:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27885 states. [2024-10-11 04:24:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27885 to 27841. [2024-10-11 04:24:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27841 states, 23682 states have (on average 1.3691833460011824) internal successors, (32425), 23923 states have internal predecessors, (32425), 2245 states have call successors, (2245), 1720 states have call predecessors, (2245), 1912 states have return successors, (3754), 2229 states have call predecessors, (3754), 2245 states have call successors, (3754) [2024-10-11 04:24:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27841 states to 27841 states and 38424 transitions. [2024-10-11 04:24:43,043 INFO L78 Accepts]: Start accepts. Automaton has 27841 states and 38424 transitions. Word has length 144 [2024-10-11 04:24:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:43,044 INFO L471 AbstractCegarLoop]: Abstraction has 27841 states and 38424 transitions. [2024-10-11 04:24:43,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:24:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 27841 states and 38424 transitions. [2024-10-11 04:24:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:24:43,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:43,085 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:43,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 04:24:43,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:43,290 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:43,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash -782339540, now seen corresponding path program 1 times [2024-10-11 04:24:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:43,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610390705] [2024-10-11 04:24:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:24:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:24:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:24:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:24:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 04:24:43,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610390705] [2024-10-11 04:24:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610390705] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377193484] [2024-10-11 04:24:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:43,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:43,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:43,411 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:43,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 04:24:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:43,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:24:43,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 04:24:43,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377193484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:24:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142068191] [2024-10-11 04:24:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:43,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:43,531 INFO L87 Difference]: Start difference. First operand 27841 states and 38424 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:24:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:47,083 INFO L93 Difference]: Finished difference Result 75539 states and 103548 transitions. [2024-10-11 04:24:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:24:47,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-11 04:24:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:47,310 INFO L225 Difference]: With dead ends: 75539 [2024-10-11 04:24:47,310 INFO L226 Difference]: Without dead ends: 49843 [2024-10-11 04:24:47,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:47,379 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 139 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 8354 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:47,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 8354 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:24:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49843 states. [2024-10-11 04:24:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49843 to 49841. [2024-10-11 04:24:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49841 states, 41974 states have (on average 1.333468337542288) internal successors, (55971), 42455 states have internal predecessors, (55971), 4265 states have call successors, (4265), 3216 states have call predecessors, (4265), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2024-10-11 04:24:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49841 states to 49841 states and 68436 transitions. [2024-10-11 04:24:51,280 INFO L78 Accepts]: Start accepts. Automaton has 49841 states and 68436 transitions. Word has length 144 [2024-10-11 04:24:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:51,280 INFO L471 AbstractCegarLoop]: Abstraction has 49841 states and 68436 transitions. [2024-10-11 04:24:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:24:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 49841 states and 68436 transitions. [2024-10-11 04:24:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 04:24:51,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:51,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:24:51,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 04:24:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 04:24:51,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:51,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash -873894743, now seen corresponding path program 1 times [2024-10-11 04:24:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162311337] [2024-10-11 04:24:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:24:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:24:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:24:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:24:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:24:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 04:24:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:24:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 04:24:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 04:24:51,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:51,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162311337] [2024-10-11 04:24:51,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162311337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:24:51,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428762397] [2024-10-11 04:24:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:51,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:24:51,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:51,666 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:24:51,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 04:24:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:24:51,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:24:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 04:24:51,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:24:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428762397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:24:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:24:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72136871] [2024-10-11 04:24:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:51,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:24:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:24:51,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:51,812 INFO L87 Difference]: Start difference. First operand 49841 states and 68436 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)