./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd6bcae8fdfc31b6b7d4775dfad537e0ca42e395c3a990a218ee828052c4f57f7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d6bcae8fdfc31b6b7d4775dfad537e0ca42e395c3a990a218ee828052c4f57f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:59:46,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:59:47,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:59:47,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:59:47,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:59:47,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:59:47,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:59:47,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:59:47,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:59:47,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:59:47,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:59:47,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:59:47,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:59:47,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:59:47,092 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:59:47,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:59:47,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:59:47,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:59:47,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:59:47,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:59:47,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:59:47,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:59:47,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:59:47,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:59:47,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:59:47,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> d6bcae8fdfc31b6b7d4775dfad537e0ca42e395c3a990a218ee828052c4f57f7 [2024-11-07 00:59:47,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:59:47,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:59:47,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:59:47,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:59:47,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:59:47,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c [2024-11-07 00:59:48,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:59:48,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:59:48,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c [2024-11-07 00:59:48,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef1b15100/718d18900cf44fa8ae133a141785b4cf/FLAG481e33126 [2024-11-07 00:59:48,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef1b15100/718d18900cf44fa8ae133a141785b4cf [2024-11-07 00:59:48,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:59:48,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:59:48,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:59:48,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:59:48,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:59:48,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:59:48" (1/1) ... [2024-11-07 00:59:48,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26257619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:48, skipping insertion in model container [2024-11-07 00:59:48,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:59:48" (1/1) ... [2024-11-07 00:59:48,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:59:49,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c[381679,381692] [2024-11-07 00:59:49,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c[383339,383352] [2024-11-07 00:59:50,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:59:50,011 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:59:50,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c[381679,381692] [2024-11-07 00:59:50,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-2.c[383339,383352] [2024-11-07 00:59:50,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:59:50,632 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:59:50,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50 WrapperNode [2024-11-07 00:59:50,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:59:50,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:59:50,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:59:50,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:59:50,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:50,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,064 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12873 [2024-11-07 00:59:51,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:59:51,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:59:51,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:59:51,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:59:51,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,234 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-11-07 00:59:51,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:59:51,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:59:51,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:59:51,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:59:51,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (1/1) ... [2024-11-07 00:59:51,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:59:51,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:59:51,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:59:51,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:59:51,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:59:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:59:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:59:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:59:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:59:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:59:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:59:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:59:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:59:51,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:59:51,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:59:57,612 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2024-11-07 00:59:57,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:59:57,661 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:59:57,661 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-07 00:59:57,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:59:57 BoogieIcfgContainer [2024-11-07 00:59:57,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:59:57,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:59:57,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:59:57,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:59:57,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:59:48" (1/3) ... [2024-11-07 00:59:57,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49593615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:59:57, skipping insertion in model container [2024-11-07 00:59:57,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:50" (2/3) ... [2024-11-07 00:59:57,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49593615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:59:57, skipping insertion in model container [2024-11-07 00:59:57,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:59:57" (3/3) ... [2024-11-07 00:59:57,669 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.06.cil-2.c [2024-11-07 00:59:57,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:59:57,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:59:57,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:59:57,768 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;@7b64ed82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:59:57,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:59:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 2422 states, 2393 states have (on average 1.8487254492269118) internal successors, (4424), 2396 states have internal predecessors, (4424), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 00:59:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 00:59:57,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:57,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:59:57,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash -603322071, now seen corresponding path program 1 times [2024-11-07 00:59:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:57,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732047867] [2024-11-07 00:59:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:58,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 00:59:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:58,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 00:59:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:59:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 00:59:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:59:58,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732047867] [2024-11-07 00:59:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732047867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:58,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:58,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:59:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3343019] [2024-11-07 00:59:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:58,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:59:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:58,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:59:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:59:58,161 INFO L87 Difference]: Start difference. First operand has 2422 states, 2393 states have (on average 1.8487254492269118) internal successors, (4424), 2396 states have internal predecessors, (4424), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:59,173 INFO L93 Difference]: Finished difference Result 4910 states and 9040 transitions. [2024-11-07 00:59:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:59:59,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-07 00:59:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:59,193 INFO L225 Difference]: With dead ends: 4910 [2024-11-07 00:59:59,196 INFO L226 Difference]: Without dead ends: 2431 [2024-11-07 00:59:59,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:59:59,209 INFO L432 NwaCegarLoop]: 4245 mSDtfsCounter, 595 mSDsluCounter, 12323 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 16568 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:59,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 16568 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:59:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2024-11-07 00:59:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2355. [2024-11-07 00:59:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2327 states have (on average 1.8362698753760207) internal successors, (4273), 2329 states have internal predecessors, (4273), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 00:59:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 4313 transitions. [2024-11-07 00:59:59,333 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 4313 transitions. Word has length 112 [2024-11-07 00:59:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:59,334 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 4313 transitions. [2024-11-07 00:59:59,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 4313 transitions. [2024-11-07 00:59:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 00:59:59,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:59,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:59:59,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:59:59,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:59,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1634362969, now seen corresponding path program 1 times [2024-11-07 00:59:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300715634] [2024-11-07 00:59:59,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:59,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:59,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 00:59:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 00:59:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:59,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:59:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:59,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 00:59:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:59:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:59,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300715634] [2024-11-07 00:59:59,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300715634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:59,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317536426] [2024-11-07 00:59:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:59,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:59,614 INFO L87 Difference]: Start difference. First operand 2355 states and 4313 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:01,354 INFO L93 Difference]: Finished difference Result 2966 states and 5283 transitions. [2024-11-07 01:00:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:00:01,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:01,368 INFO L225 Difference]: With dead ends: 2966 [2024-11-07 01:00:01,368 INFO L226 Difference]: Without dead ends: 2746 [2024-11-07 01:00:01,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:00:01,370 INFO L432 NwaCegarLoop]: 4310 mSDtfsCounter, 4796 mSDsluCounter, 17001 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 21311 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:01,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 21311 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:00:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2024-11-07 01:00:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2585. [2024-11-07 01:00:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2532 states have (on average 1.8131911532385465) internal successors, (4591), 2536 states have internal predecessors, (4591), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-11-07 01:00:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 4672 transitions. [2024-11-07 01:00:01,444 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 4672 transitions. Word has length 112 [2024-11-07 01:00:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:01,445 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 4672 transitions. [2024-11-07 01:00:01,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4672 transitions. [2024-11-07 01:00:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:01,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:01,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:01,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:00:01,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:01,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1041629413, now seen corresponding path program 1 times [2024-11-07 01:00:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:01,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350066618] [2024-11-07 01:00:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:01,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:01,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:01,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:01,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350066618] [2024-11-07 01:00:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350066618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:01,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694597160] [2024-11-07 01:00:01,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:01,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:01,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:01,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:01,666 INFO L87 Difference]: Start difference. First operand 2585 states and 4672 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:03,238 INFO L93 Difference]: Finished difference Result 3746 states and 6496 transitions. [2024-11-07 01:00:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:00:03,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:03,252 INFO L225 Difference]: With dead ends: 3746 [2024-11-07 01:00:03,252 INFO L226 Difference]: Without dead ends: 3298 [2024-11-07 01:00:03,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:00:03,256 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4821 mSDsluCounter, 16938 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4834 SdHoareTripleChecker+Valid, 21205 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:03,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4834 Valid, 21205 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:00:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2024-11-07 01:00:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3009. [2024-11-07 01:00:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2912 states have (on average 1.7747252747252746) internal successors, (5168), 2918 states have internal predecessors, (5168), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-11-07 01:00:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 5319 transitions. [2024-11-07 01:00:03,336 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 5319 transitions. Word has length 112 [2024-11-07 01:00:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:03,337 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 5319 transitions. [2024-11-07 01:00:03,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 5319 transitions. [2024-11-07 01:00:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:03,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:03,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:00:03,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash 158120423, now seen corresponding path program 1 times [2024-11-07 01:00:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635556909] [2024-11-07 01:00:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:03,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:03,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635556909] [2024-11-07 01:00:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635556909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:03,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:03,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:03,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488905440] [2024-11-07 01:00:03,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:03,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:03,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:03,487 INFO L87 Difference]: Start difference. First operand 3009 states and 5319 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:05,063 INFO L93 Difference]: Finished difference Result 5272 states and 8863 transitions. [2024-11-07 01:00:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:00:05,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:05,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:05,078 INFO L225 Difference]: With dead ends: 5272 [2024-11-07 01:00:05,079 INFO L226 Difference]: Without dead ends: 4400 [2024-11-07 01:00:05,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:00:05,082 INFO L432 NwaCegarLoop]: 4304 mSDtfsCounter, 4796 mSDsluCounter, 17001 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 21305 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:05,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 21305 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:00:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2024-11-07 01:00:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 3859. [2024-11-07 01:00:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3674 states have (on average 1.7212847033206315) internal successors, (6324), 3684 states have internal predecessors, (6324), 127 states have call successors, (127), 48 states have call predecessors, (127), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-11-07 01:00:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 6621 transitions. [2024-11-07 01:00:05,214 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 6621 transitions. Word has length 112 [2024-11-07 01:00:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:05,215 INFO L471 AbstractCegarLoop]: Abstraction has 3859 states and 6621 transitions. [2024-11-07 01:00:05,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 6621 transitions. [2024-11-07 01:00:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:05,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:05,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:00:05,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash 129620133, now seen corresponding path program 1 times [2024-11-07 01:00:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253566665] [2024-11-07 01:00:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:05,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:05,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253566665] [2024-11-07 01:00:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253566665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:05,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:05,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:05,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378465742] [2024-11-07 01:00:05,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:05,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:05,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:05,366 INFO L87 Difference]: Start difference. First operand 3859 states and 6621 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:06,747 INFO L93 Difference]: Finished difference Result 8322 states and 13611 transitions. [2024-11-07 01:00:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:00:06,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:06,769 INFO L225 Difference]: With dead ends: 8322 [2024-11-07 01:00:06,769 INFO L226 Difference]: Without dead ends: 6600 [2024-11-07 01:00:06,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:00:06,775 INFO L432 NwaCegarLoop]: 4306 mSDtfsCounter, 4796 mSDsluCounter, 17001 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 21307 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:06,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 21307 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:00:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6600 states. [2024-11-07 01:00:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6600 to 5565. [2024-11-07 01:00:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5565 states, 5204 states have (on average 1.6610299769408148) internal successors, (8644), 5222 states have internal predecessors, (8644), 247 states have call successors, (247), 96 states have call predecessors, (247), 112 states have return successors, (360), 262 states have call predecessors, (360), 247 states have call successors, (360) [2024-11-07 01:00:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 9251 transitions. [2024-11-07 01:00:06,981 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 9251 transitions. Word has length 112 [2024-11-07 01:00:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:06,981 INFO L471 AbstractCegarLoop]: Abstraction has 5565 states and 9251 transitions. [2024-11-07 01:00:06,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 9251 transitions. [2024-11-07 01:00:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:06,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:06,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:06,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:00:06,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:06,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1810961881, now seen corresponding path program 1 times [2024-11-07 01:00:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:06,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617120534] [2024-11-07 01:00:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:07,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617120534] [2024-11-07 01:00:07,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617120534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:07,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398931751] [2024-11-07 01:00:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:07,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:07,202 INFO L87 Difference]: Start difference. First operand 5565 states and 9251 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:08,742 INFO L93 Difference]: Finished difference Result 14420 states and 23163 transitions. [2024-11-07 01:00:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:00:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:08,790 INFO L225 Difference]: With dead ends: 14420 [2024-11-07 01:00:08,790 INFO L226 Difference]: Without dead ends: 10992 [2024-11-07 01:00:08,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:00:08,802 INFO L432 NwaCegarLoop]: 4307 mSDtfsCounter, 4796 mSDsluCounter, 17001 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 21308 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:08,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 21308 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:00:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10992 states. [2024-11-07 01:00:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10992 to 8991. [2024-11-07 01:00:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8991 states, 8278 states have (on average 1.6071514858661513) internal successors, (13304), 8312 states have internal predecessors, (13304), 487 states have call successors, (487), 192 states have call predecessors, (487), 224 states have return successors, (794), 518 states have call predecessors, (794), 487 states have call successors, (794) [2024-11-07 01:00:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8991 states to 8991 states and 14585 transitions. [2024-11-07 01:00:09,106 INFO L78 Accepts]: Start accepts. Automaton has 8991 states and 14585 transitions. Word has length 112 [2024-11-07 01:00:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 8991 states and 14585 transitions. [2024-11-07 01:00:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8991 states and 14585 transitions. [2024-11-07 01:00:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:09,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:09,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:09,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:00:09,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:09,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash 66101349, now seen corresponding path program 1 times [2024-11-07 01:00:09,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:09,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173549286] [2024-11-07 01:00:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:09,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173549286] [2024-11-07 01:00:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173549286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:09,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092650667] [2024-11-07 01:00:09,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:09,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:09,319 INFO L87 Difference]: Start difference. First operand 8991 states and 14585 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:11,257 INFO L93 Difference]: Finished difference Result 26614 states and 42455 transitions. [2024-11-07 01:00:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:00:11,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:11,313 INFO L225 Difference]: With dead ends: 26614 [2024-11-07 01:00:11,313 INFO L226 Difference]: Without dead ends: 19760 [2024-11-07 01:00:11,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:00:11,332 INFO L432 NwaCegarLoop]: 4307 mSDtfsCounter, 4796 mSDsluCounter, 17001 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 21308 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:11,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 21308 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:00:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19760 states. [2024-11-07 01:00:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19760 to 15873. [2024-11-07 01:00:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15873 states, 14456 states have (on average 1.5680686220254565) internal successors, (22668), 14522 states have internal predecessors, (22668), 967 states have call successors, (967), 384 states have call predecessors, (967), 448 states have return successors, (1824), 1030 states have call predecessors, (1824), 967 states have call successors, (1824) [2024-11-07 01:00:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15873 states to 15873 states and 25459 transitions. [2024-11-07 01:00:12,088 INFO L78 Accepts]: Start accepts. Automaton has 15873 states and 25459 transitions. Word has length 112 [2024-11-07 01:00:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 15873 states and 25459 transitions. [2024-11-07 01:00:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 15873 states and 25459 transitions. [2024-11-07 01:00:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:12,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:12,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:12,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:00:12,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:12,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash -704632217, now seen corresponding path program 1 times [2024-11-07 01:00:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:12,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057661929] [2024-11-07 01:00:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057661929] [2024-11-07 01:00:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057661929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:12,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831224695] [2024-11-07 01:00:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:12,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:12,221 INFO L87 Difference]: Start difference. First operand 15873 states and 25459 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:14,900 INFO L93 Difference]: Finished difference Result 56952 states and 90597 transitions. [2024-11-07 01:00:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:00:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:15,031 INFO L225 Difference]: With dead ends: 56952 [2024-11-07 01:00:15,031 INFO L226 Difference]: Without dead ends: 43216 [2024-11-07 01:00:15,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:00:15,073 INFO L432 NwaCegarLoop]: 4304 mSDtfsCounter, 5054 mSDsluCounter, 16993 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5074 SdHoareTripleChecker+Valid, 21297 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:15,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5074 Valid, 21297 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:00:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43216 states. [2024-11-07 01:00:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43216 to 29507. [2024-11-07 01:00:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29507 states, 26746 states have (on average 1.546399461601735) internal successors, (41360), 26876 states have internal predecessors, (41360), 1863 states have call successors, (1863), 768 states have call predecessors, (1863), 896 states have return successors, (4306), 1990 states have call predecessors, (4306), 1863 states have call successors, (4306) [2024-11-07 01:00:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29507 states to 29507 states and 47529 transitions. [2024-11-07 01:00:16,477 INFO L78 Accepts]: Start accepts. Automaton has 29507 states and 47529 transitions. Word has length 112 [2024-11-07 01:00:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:16,477 INFO L471 AbstractCegarLoop]: Abstraction has 29507 states and 47529 transitions. [2024-11-07 01:00:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 29507 states and 47529 transitions. [2024-11-07 01:00:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:16,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:16,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:16,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:00:16,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:16,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1699325915, now seen corresponding path program 1 times [2024-11-07 01:00:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:16,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894559785] [2024-11-07 01:00:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:16,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:16,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:16,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894559785] [2024-11-07 01:00:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894559785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:16,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:16,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818768877] [2024-11-07 01:00:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:16,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:16,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:16,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:16,654 INFO L87 Difference]: Start difference. First operand 29507 states and 47529 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:20,292 INFO L93 Difference]: Finished difference Result 107773 states and 173881 transitions. [2024-11-07 01:00:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:00:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:20,686 INFO L225 Difference]: With dead ends: 107773 [2024-11-07 01:00:20,686 INFO L226 Difference]: Without dead ends: 80403 [2024-11-07 01:00:20,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:00:20,765 INFO L432 NwaCegarLoop]: 4303 mSDtfsCounter, 4989 mSDsluCounter, 16993 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5009 SdHoareTripleChecker+Valid, 21296 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:20,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5009 Valid, 21296 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:00:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80403 states. [2024-11-07 01:00:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80403 to 56837. [2024-11-07 01:00:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56837 states, 51452 states have (on average 1.536577781232994) internal successors, (79060), 51710 states have internal predecessors, (79060), 3591 states have call successors, (3591), 1536 states have call predecessors, (3591), 1792 states have return successors, (10664), 3846 states have call predecessors, (10664), 3591 states have call successors, (10664) [2024-11-07 01:00:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56837 states to 56837 states and 93315 transitions. [2024-11-07 01:00:23,861 INFO L78 Accepts]: Start accepts. Automaton has 56837 states and 93315 transitions. Word has length 112 [2024-11-07 01:00:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 56837 states and 93315 transitions. [2024-11-07 01:00:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 56837 states and 93315 transitions. [2024-11-07 01:00:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:23,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:23,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:00:23,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:23,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:23,892 INFO L85 PathProgramCache]: Analyzing trace with hash 637066595, now seen corresponding path program 1 times [2024-11-07 01:00:23,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:23,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080427634] [2024-11-07 01:00:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:24,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080427634] [2024-11-07 01:00:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080427634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:24,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937316978] [2024-11-07 01:00:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:24,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:24,016 INFO L87 Difference]: Start difference. First operand 56837 states and 93315 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:31,113 INFO L93 Difference]: Finished difference Result 208707 states and 345053 transitions. [2024-11-07 01:00:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:00:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2024-11-07 01:00:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:31,643 INFO L225 Difference]: With dead ends: 208707 [2024-11-07 01:00:31,644 INFO L226 Difference]: Without dead ends: 154007 [2024-11-07 01:00:31,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:00:31,800 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 4962 mSDsluCounter, 16933 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4982 SdHoareTripleChecker+Valid, 21201 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:31,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4982 Valid, 21201 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:00:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154007 states. [2024-11-07 01:00:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154007 to 111369. [2024-11-07 01:00:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111369 states, 100864 states have (on average 1.5326380076142132) internal successors, (154588), 101378 states have internal predecessors, (154588), 6919 states have call successors, (6919), 3072 states have call predecessors, (6919), 3584 states have return successors, (27626), 7430 states have call predecessors, (27626), 6919 states have call successors, (27626) [2024-11-07 01:00:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111369 states to 111369 states and 189133 transitions. [2024-11-07 01:00:36,720 INFO L78 Accepts]: Start accepts. Automaton has 111369 states and 189133 transitions. Word has length 112 [2024-11-07 01:00:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:00:36,720 INFO L471 AbstractCegarLoop]: Abstraction has 111369 states and 189133 transitions. [2024-11-07 01:00:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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-11-07 01:00:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 111369 states and 189133 transitions. [2024-11-07 01:00:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 01:00:36,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:00:36,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:00:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:00:36,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:00:36,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:00:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1781417883, now seen corresponding path program 1 times [2024-11-07 01:00:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:00:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27439098] [2024-11-07 01:00:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:00:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:00:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:36,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:00:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 01:00:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 01:00:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:36,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:00:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 01:00:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:00:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:00:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:00:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27439098] [2024-11-07 01:00:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27439098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:00:36,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:00:36,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:00:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47536238] [2024-11-07 01:00:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:00:36,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:00:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:00:36,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:00:36,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:00:36,898 INFO L87 Difference]: Start difference. First operand 111369 states and 189133 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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)