./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/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/systemc/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', '4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47'] 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/systemc/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 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:57:55,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:57:55,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:57:55,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:57:55,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:57:55,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:57:55,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:57:55,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:57:55,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:57:55,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:57:55,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:57:55,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:57:55,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:57:55,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:57:55,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:57:55,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:57:55,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:57:55,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:55,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:57:55,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:57:55,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:57:55,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:57:55,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:57:55,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:57:55,424 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 -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2024-11-06 23:57:55,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:57:55,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:57:55,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:57:55,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:57:55,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:57:55,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-11-06 23:57:56,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:57:57,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:57:57,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-11-06 23:57:57,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a149cc78d/a5a13b6e413a4aaaa47127ab81f63a01/FLAGf5b33f5c7 [2024-11-06 23:57:57,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a149cc78d/a5a13b6e413a4aaaa47127ab81f63a01 [2024-11-06 23:57:57,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:57:57,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:57:57,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:57,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:57:57,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:57:57,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f10278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57, skipping insertion in model container [2024-11-06 23:57:57,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:57:57,648 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/systemc/token_ring.06.cil-2.c[671,684] [2024-11-06 23:57:57,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:57,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:57:57,765 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/systemc/token_ring.06.cil-2.c[671,684] [2024-11-06 23:57:57,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:57,806 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:57:57,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57 WrapperNode [2024-11-06 23:57:57,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:57,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:57,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:57:57,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:57:57,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,836 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 519 [2024-11-06 23:57:57,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:57,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:57:57,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:57:57,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:57:57,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,851 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-06 23:57:57,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:57:57,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:57:57,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:57:57,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:57:57,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (1/1) ... [2024-11-06 23:57:57,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:57,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:57:57,890 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-06 23:57:57,892 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-06 23:57:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:57:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-06 23:57:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-06 23:57:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-06 23:57:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-06 23:57:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-06 23:57:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-06 23:57:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-06 23:57:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-06 23:57:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-06 23:57:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-06 23:57:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:57:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-06 23:57:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-06 23:57:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:57:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:57:57,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:57:57,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:57:58,446 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-06 23:57:58,447 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:57:58,466 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:57:58,466 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-06 23:57:58,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:58 BoogieIcfgContainer [2024-11-06 23:57:58,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:57:58,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:57:58,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:57:58,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:57:58,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:57:57" (1/3) ... [2024-11-06 23:57:58,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c23ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:58, skipping insertion in model container [2024-11-06 23:57:58,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:57" (2/3) ... [2024-11-06 23:57:58,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c23ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:58, skipping insertion in model container [2024-11-06 23:57:58,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:58" (3/3) ... [2024-11-06 23:57:58,476 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2024-11-06 23:57:58,487 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:57:58,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:57:58,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:57:58,544 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;@20804d92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:57:58,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:57:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 211 states have (on average 1.6113744075829384) internal successors, (340), 213 states have internal predecessors, (340), 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-06 23:57:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:57:58,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:58,556 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] [2024-11-06 23:57:58,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:58,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1989971987, now seen corresponding path program 1 times [2024-11-06 23:57:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497015710] [2024-11-06 23:57:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:57:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:57:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:57:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:57:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:58,929 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-06 23:57:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497015710] [2024-11-06 23:57:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497015710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:58,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:58,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:57:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161430536] [2024-11-06 23:57:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:57:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:58,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:57:58,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:57:58,960 INFO L87 Difference]: Start difference. First operand has 239 states, 211 states have (on average 1.6113744075829384) internal successors, (340), 213 states have internal predecessors, (340), 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.2) internal successors, (101), 3 states have internal predecessors, (101), 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-06 23:57:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:59,796 INFO L93 Difference]: Finished difference Result 547 states and 882 transitions. [2024-11-06 23:57:59,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:57:59,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 111 [2024-11-06 23:57:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:59,805 INFO L225 Difference]: With dead ends: 547 [2024-11-06 23:57:59,805 INFO L226 Difference]: Without dead ends: 310 [2024-11-06 23:57:59,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:57:59,810 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 595 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:59,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 477 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:57:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-06 23:57:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 234. [2024-11-06 23:57:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.5217391304347827) internal successors, (315), 208 states have internal predecessors, (315), 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-06 23:57:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 355 transitions. [2024-11-06 23:57:59,853 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 355 transitions. Word has length 111 [2024-11-06 23:57:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:59,853 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 355 transitions. [2024-11-06 23:57:59,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-06 23:57:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 355 transitions. [2024-11-06 23:57:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:57:59,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:59,856 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] [2024-11-06 23:57:59,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:57:59,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 915701295, now seen corresponding path program 1 times [2024-11-06 23:57:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116147894] [2024-11-06 23:57:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:57:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:00,066 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-06 23:58:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116147894] [2024-11-06 23:58:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116147894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:58:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87503888] [2024-11-06 23:58:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:00,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:58:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:58:00,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:58:00,069 INFO L87 Difference]: Start difference. First operand 234 states and 355 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-06 23:58:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:01,260 INFO L93 Difference]: Finished difference Result 832 states and 1296 transitions. [2024-11-06 23:58:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:58:01,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:01,265 INFO L225 Difference]: With dead ends: 832 [2024-11-06 23:58:01,267 INFO L226 Difference]: Without dead ends: 612 [2024-11-06 23:58:01,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:58:01,271 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 878 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:01,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 794 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 23:58:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-06 23:58:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 461. [2024-11-06 23:58:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 412 states have (on average 1.5339805825242718) internal successors, (632), 414 states have internal predecessors, (632), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-11-06 23:58:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 705 transitions. [2024-11-06 23:58:01,323 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 705 transitions. Word has length 111 [2024-11-06 23:58:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:01,324 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 705 transitions. [2024-11-06 23:58:01,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-06 23:58:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 705 transitions. [2024-11-06 23:58:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:01,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:01,328 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] [2024-11-06 23:58:01,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:58:01,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:01,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2100267341, now seen corresponding path program 1 times [2024-11-06 23:58:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:01,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520691828] [2024-11-06 23:58:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,613 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-06 23:58:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:01,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520691828] [2024-11-06 23:58:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520691828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:01,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885647813] [2024-11-06 23:58:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:01,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:01,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:01,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:01,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:01,619 INFO L87 Difference]: Start difference. First operand 461 states and 705 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:03,473 INFO L93 Difference]: Finished difference Result 1369 states and 2130 transitions. [2024-11-06 23:58:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:03,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:03,478 INFO L225 Difference]: With dead ends: 1369 [2024-11-06 23:58:03,478 INFO L226 Difference]: Without dead ends: 922 [2024-11-06 23:58:03,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:03,480 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 889 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:03,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1516 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:58:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-06 23:58:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 673. [2024-11-06 23:58:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 602 states have (on average 1.526578073089701) internal successors, (919), 605 states have internal predecessors, (919), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-06 23:58:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1024 transitions. [2024-11-06 23:58:03,510 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1024 transitions. Word has length 111 [2024-11-06 23:58:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:03,511 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1024 transitions. [2024-11-06 23:58:03,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1024 transitions. [2024-11-06 23:58:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:03,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:03,512 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] [2024-11-06 23:58:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:58:03,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:03,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash 575725041, now seen corresponding path program 1 times [2024-11-06 23:58:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:03,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364286466] [2024-11-06 23:58:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,691 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-06 23:58:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364286466] [2024-11-06 23:58:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364286466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971277699] [2024-11-06 23:58:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:03,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:03,692 INFO L87 Difference]: Start difference. First operand 673 states and 1024 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:05,341 INFO L93 Difference]: Finished difference Result 2160 states and 3351 transitions. [2024-11-06 23:58:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:05,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:05,347 INFO L225 Difference]: With dead ends: 2160 [2024-11-06 23:58:05,347 INFO L226 Difference]: Without dead ends: 1501 [2024-11-06 23:58:05,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:05,349 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 959 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:05,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 987 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-06 23:58:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1098. [2024-11-06 23:58:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 983 states have (on average 1.5198372329603256) internal successors, (1494), 988 states have internal predecessors, (1494), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-11-06 23:58:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1667 transitions. [2024-11-06 23:58:05,399 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1667 transitions. Word has length 111 [2024-11-06 23:58:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:05,399 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1667 transitions. [2024-11-06 23:58:05,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1667 transitions. [2024-11-06 23:58:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:05,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:05,401 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] [2024-11-06 23:58:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:58:05,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -307783949, now seen corresponding path program 1 times [2024-11-06 23:58:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540070340] [2024-11-06 23:58:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,566 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-06 23:58:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540070340] [2024-11-06 23:58:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540070340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:05,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:05,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:05,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866143167] [2024-11-06 23:58:05,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:05,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:05,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:05,568 INFO L87 Difference]: Start difference. First operand 1098 states and 1667 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:07,380 INFO L93 Difference]: Finished difference Result 3682 states and 5690 transitions. [2024-11-06 23:58:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:07,389 INFO L225 Difference]: With dead ends: 3682 [2024-11-06 23:58:07,389 INFO L226 Difference]: Without dead ends: 2598 [2024-11-06 23:58:07,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:07,391 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 887 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:07,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1514 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:58:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2024-11-06 23:58:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 1954. [2024-11-06 23:58:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1751 states have (on average 1.515705311250714) internal successors, (2654), 1760 states have internal predecessors, (2654), 140 states have call successors, (140), 54 states have call predecessors, (140), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-11-06 23:58:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2969 transitions. [2024-11-06 23:58:07,500 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2969 transitions. Word has length 111 [2024-11-06 23:58:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:07,500 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2969 transitions. [2024-11-06 23:58:07,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2969 transitions. [2024-11-06 23:58:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:07,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:07,502 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] [2024-11-06 23:58:07,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:58:07,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:07,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2046601333, now seen corresponding path program 1 times [2024-11-06 23:58:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:07,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515208265] [2024-11-06 23:58:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:07,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:07,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:07,654 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-06 23:58:07,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:07,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515208265] [2024-11-06 23:58:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515208265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:07,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:07,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:07,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760628541] [2024-11-06 23:58:07,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:07,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:07,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:07,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:07,656 INFO L87 Difference]: Start difference. First operand 1954 states and 2969 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:09,205 INFO L93 Difference]: Finished difference Result 6736 states and 10402 transitions. [2024-11-06 23:58:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:09,219 INFO L225 Difference]: With dead ends: 6736 [2024-11-06 23:58:09,220 INFO L226 Difference]: Without dead ends: 4796 [2024-11-06 23:58:09,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:09,224 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 886 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:09,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1514 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2024-11-06 23:58:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 3671. [2024-11-06 23:58:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3292 states have (on average 1.5127582017010937) internal successors, (4980), 3309 states have internal predecessors, (4980), 260 states have call successors, (260), 102 states have call predecessors, (260), 118 states have return successors, (357), 275 states have call predecessors, (357), 260 states have call successors, (357) [2024-11-06 23:58:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5597 transitions. [2024-11-06 23:58:09,396 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5597 transitions. Word has length 111 [2024-11-06 23:58:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:09,396 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 5597 transitions. [2024-11-06 23:58:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5597 transitions. [2024-11-06 23:58:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:09,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:09,399 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] [2024-11-06 23:58:09,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:58:09,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:09,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -371302733, now seen corresponding path program 1 times [2024-11-06 23:58:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572318514] [2024-11-06 23:58:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:09,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:09,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:09,529 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-06 23:58:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572318514] [2024-11-06 23:58:09,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572318514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:09,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805570897] [2024-11-06 23:58:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:09,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:09,532 INFO L87 Difference]: Start difference. First operand 3671 states and 5597 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:11,204 INFO L93 Difference]: Finished difference Result 12843 states and 19884 transitions. [2024-11-06 23:58:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:11,228 INFO L225 Difference]: With dead ends: 12843 [2024-11-06 23:58:11,229 INFO L226 Difference]: Without dead ends: 9186 [2024-11-06 23:58:11,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:11,236 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 885 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:11,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1514 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1949 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9186 states. [2024-11-06 23:58:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9186 to 7120. [2024-11-06 23:58:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7120 states, 6389 states have (on average 1.5110345907027705) internal successors, (9654), 6422 states have internal predecessors, (9654), 500 states have call successors, (500), 198 states have call predecessors, (500), 230 states have return successors, (775), 531 states have call predecessors, (775), 500 states have call successors, (775) [2024-11-06 23:58:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7120 states to 7120 states and 10929 transitions. [2024-11-06 23:58:11,643 INFO L78 Accepts]: Start accepts. Automaton has 7120 states and 10929 transitions. Word has length 111 [2024-11-06 23:58:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:11,644 INFO L471 AbstractCegarLoop]: Abstraction has 7120 states and 10929 transitions. [2024-11-06 23:58:11,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 7120 states and 10929 transitions. [2024-11-06 23:58:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:11,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:11,653 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] [2024-11-06 23:58:11,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:58:11,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1142036299, now seen corresponding path program 1 times [2024-11-06 23:58:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602767241] [2024-11-06 23:58:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:11,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:11,779 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-06 23:58:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:11,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602767241] [2024-11-06 23:58:11,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602767241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:11,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918378637] [2024-11-06 23:58:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:11,780 INFO L87 Difference]: Start difference. First operand 7120 states and 10929 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:13,825 INFO L93 Difference]: Finished difference Result 28034 states and 43524 transitions. [2024-11-06 23:58:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:13,895 INFO L225 Difference]: With dead ends: 28034 [2024-11-06 23:58:13,895 INFO L226 Difference]: Without dead ends: 20928 [2024-11-06 23:58:13,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:13,913 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 1136 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:13,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1504 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2024-11-06 23:58:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 13953. [2024-11-06 23:58:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13953 states, 12550 states have (on average 1.5126693227091634) internal successors, (18984), 12615 states have internal predecessors, (18984), 948 states have call successors, (948), 390 states have call predecessors, (948), 454 states have return successors, (1741), 1011 states have call predecessors, (1741), 948 states have call successors, (1741) [2024-11-06 23:58:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13953 states to 13953 states and 21673 transitions. [2024-11-06 23:58:14,639 INFO L78 Accepts]: Start accepts. Automaton has 13953 states and 21673 transitions. Word has length 111 [2024-11-06 23:58:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:14,640 INFO L471 AbstractCegarLoop]: Abstraction has 13953 states and 21673 transitions. [2024-11-06 23:58:14,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13953 states and 21673 transitions. [2024-11-06 23:58:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:14,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:14,652 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] [2024-11-06 23:58:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:58:14,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2136729997, now seen corresponding path program 1 times [2024-11-06 23:58:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259142679] [2024-11-06 23:58:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:14,820 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-06 23:58:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259142679] [2024-11-06 23:58:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259142679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503872360] [2024-11-06 23:58:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:14,821 INFO L87 Difference]: Start difference. First operand 13953 states and 21673 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:17,950 INFO L93 Difference]: Finished difference Result 54385 states and 85322 transitions. [2024-11-06 23:58:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:18,068 INFO L225 Difference]: With dead ends: 54385 [2024-11-06 23:58:18,068 INFO L226 Difference]: Without dead ends: 40446 [2024-11-06 23:58:18,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:18,109 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 935 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:18,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1500 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 23:58:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40446 states. [2024-11-06 23:58:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40446 to 27266. [2024-11-06 23:58:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27266 states, 24551 states have (on average 1.5136654311433342) internal successors, (37162), 24680 states have internal predecessors, (37162), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 902 states have return successors, (4127), 1939 states have call predecessors, (4127), 1812 states have call successors, (4127) [2024-11-06 23:58:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27266 states to 27266 states and 43101 transitions. [2024-11-06 23:58:19,462 INFO L78 Accepts]: Start accepts. Automaton has 27266 states and 43101 transitions. Word has length 111 [2024-11-06 23:58:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:19,462 INFO L471 AbstractCegarLoop]: Abstraction has 27266 states and 43101 transitions. [2024-11-06 23:58:19,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27266 states and 43101 transitions. [2024-11-06 23:58:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:19,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:19,498 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] [2024-11-06 23:58:19,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:58:19,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1571961077, now seen corresponding path program 1 times [2024-11-06 23:58:19,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112956020] [2024-11-06 23:58:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:19,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:19,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:19,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:19,630 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-06 23:58:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112956020] [2024-11-06 23:58:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112956020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:19,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:19,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:19,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269273602] [2024-11-06 23:58:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:19,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:19,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:19,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:19,631 INFO L87 Difference]: Start difference. First operand 27266 states and 43101 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:24,259 INFO L93 Difference]: Finished difference Result 104944 states and 167376 transitions. [2024-11-06 23:58:24,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:24,480 INFO L225 Difference]: With dead ends: 104944 [2024-11-06 23:58:24,481 INFO L226 Difference]: Without dead ends: 77692 [2024-11-06 23:58:24,547 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-06 23:58:24,548 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 1056 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:24,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1504 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77692 states. [2024-11-06 23:58:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77692 to 54147. [2024-11-06 23:58:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54147 states, 48872 states have (on average 1.5160419053854968) internal successors, (74092), 49129 states have internal predecessors, (74092), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 1798 states have return successors, (10293), 3731 states have call predecessors, (10293), 3476 states have call successors, (10293) [2024-11-06 23:58:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54147 states to 54147 states and 87861 transitions. [2024-11-06 23:58:27,211 INFO L78 Accepts]: Start accepts. Automaton has 54147 states and 87861 transitions. Word has length 111 [2024-11-06 23:58:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:27,211 INFO L471 AbstractCegarLoop]: Abstraction has 54147 states and 87861 transitions. [2024-11-06 23:58:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 54147 states and 87861 transitions. [2024-11-06 23:58:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:27,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:27,246 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] [2024-11-06 23:58:27,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 23:58:27,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:27,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash -386613709, now seen corresponding path program 1 times [2024-11-06 23:58:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075482699] [2024-11-06 23:58:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:27,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:27,387 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-06 23:58:27,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075482699] [2024-11-06 23:58:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075482699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:27,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:27,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106502627] [2024-11-06 23:58:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:27,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:27,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:27,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:27,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:27,390 INFO L87 Difference]: Start difference. First operand 54147 states and 87861 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:34,093 INFO L93 Difference]: Finished difference Result 204527 states and 334950 transitions. [2024-11-06 23:58:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-11-06 23:58:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:34,571 INFO L225 Difference]: With dead ends: 204527 [2024-11-06 23:58:34,571 INFO L226 Difference]: Without dead ends: 150394 [2024-11-06 23:58:34,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:34,915 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1075 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:34,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 985 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 23:58:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150394 states. [2024-11-06 23:58:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150394 to 107780. [2024-11-06 23:58:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107780 states, 97513 states have (on average 1.5185462451160359) internal successors, (148078), 98026 states have internal predecessors, (148078), 6676 states have call successors, (6676), 3078 states have call predecessors, (6676), 3590 states have return successors, (26871), 7187 states have call predecessors, (26871), 6676 states have call successors, (26871) [2024-11-06 23:58:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107780 states to 107780 states and 181625 transitions. [2024-11-06 23:58:40,889 INFO L78 Accepts]: Start accepts. Automaton has 107780 states and 181625 transitions. Word has length 111 [2024-11-06 23:58:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:40,890 INFO L471 AbstractCegarLoop]: Abstraction has 107780 states and 181625 transitions. [2024-11-06 23:58:40,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-06 23:58:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 107780 states and 181625 transitions. [2024-11-06 23:58:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 23:58:40,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:40,939 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] [2024-11-06 23:58:40,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 23:58:40,939 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1489869109, now seen corresponding path program 1 times [2024-11-06 23:58:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980804047] [2024-11-06 23:58:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:40,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:58:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 23:58:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:58:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-06 23:58:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:41,039 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-06 23:58:41,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980804047] [2024-11-06 23:58:41,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980804047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:41,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:41,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:41,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815401539] [2024-11-06 23:58:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:41,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:41,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:41,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:41,041 INFO L87 Difference]: Start difference. First operand 107780 states and 181625 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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)