./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.13.cil.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/transmitter.13.cil.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', '5975f0f3825b3a6653676f33bd69d14e1e58fcf0306bfb5508ab91dc8951d6c4'] 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/transmitter.13.cil.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 5975f0f3825b3a6653676f33bd69d14e1e58fcf0306bfb5508ab91dc8951d6c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:00:08,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:00:09,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:00:09,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:00:09,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:00:09,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:00:09,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:00:09,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:00:09,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:00:09,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:00:09,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:00:09,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:00:09,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:00:09,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:00:09,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:00:09,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:00:09,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:00:09,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:00:09,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:00:09,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:00:09,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:00:09,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:00:09,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:00:09,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:00:09,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:00:09,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:00:09,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:00:09,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:00:09,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:00:09,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:00:09,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:00:09,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:00:09,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:00:09,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:00:09,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:00:09,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:00:09,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:00:09,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:00:09,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:00:09,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:00:09,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:00:09,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:00:09,078 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 -> 5975f0f3825b3a6653676f33bd69d14e1e58fcf0306bfb5508ab91dc8951d6c4 [2024-11-07 00:00:09,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:00:09,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:00:09,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:00:09,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:00:09,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:00:09,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.13.cil.c [2024-11-07 00:00:11,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:00:11,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:00:11,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.13.cil.c [2024-11-07 00:00:11,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93b5d78c1/19ad661c479342f6b31b06d32201d9b0/FLAGe2bafea40 [2024-11-07 00:00:11,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93b5d78c1/19ad661c479342f6b31b06d32201d9b0 [2024-11-07 00:00:11,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:00:11,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:00:11,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:00:11,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:00:11,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:00:11,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:00:11" (1/1) ... [2024-11-07 00:00:11,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ff1c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:11, skipping insertion in model container [2024-11-07 00:00:11,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:00:11" (1/1) ... [2024-11-07 00:00:11,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:00:11,767 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/transmitter.13.cil.c[706,719] [2024-11-07 00:00:11,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:00:11,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:00:11,931 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/transmitter.13.cil.c[706,719] [2024-11-07 00:00:11,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:00:12,002 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:00:12,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12 WrapperNode [2024-11-07 00:00:12,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:00:12,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:00:12,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:00:12,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:00:12,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,063 INFO L138 Inliner]: procedures = 54, calls = 69, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 918 [2024-11-07 00:00:12,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:00:12,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:00:12,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:00:12,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:00:12,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,096 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:00:12,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:00:12,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:00:12,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:00:12,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:00:12,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (1/1) ... [2024-11-07 00:00:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:00:12,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:00:12,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:00:12,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:00:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:00:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:00:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:00:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:00:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:00:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:00:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:00:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:00:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:00:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:00:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:00:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:00:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:00:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:00:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:00:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:00:12,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:00:12,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:00:13,539 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-07 00:00:13,539 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:00:13,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:00:13,570 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-07 00:00:13,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:00:13 BoogieIcfgContainer [2024-11-07 00:00:13,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:00:13,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:00:13,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:00:13,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:00:13,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:00:11" (1/3) ... [2024-11-07 00:00:13,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ebe3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:00:13, skipping insertion in model container [2024-11-07 00:00:13,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:00:12" (2/3) ... [2024-11-07 00:00:13,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ebe3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:00:13, skipping insertion in model container [2024-11-07 00:00:13,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:00:13" (3/3) ... [2024-11-07 00:00:13,586 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.13.cil.c [2024-11-07 00:00:13,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:00:13,604 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:00:13,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:00:13,716 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;@70c3aecb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:00:13,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:00:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 417 states, 383 states have (on average 1.6422976501305484) internal successors, (629), 385 states have internal predecessors, (629), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:00:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:13,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:13,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:13,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:13,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1171571176, now seen corresponding path program 1 times [2024-11-07 00:00:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920107032] [2024-11-07 00:00:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:14,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:14,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:14,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920107032] [2024-11-07 00:00:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920107032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:00:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205204915] [2024-11-07 00:00:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:00:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:00:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:00:14,545 INFO L87 Difference]: Start difference. First operand has 417 states, 383 states have (on average 1.6422976501305484) internal successors, (629), 385 states have internal predecessors, (629), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 3 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:17,081 INFO L93 Difference]: Finished difference Result 978 states and 1612 transitions. [2024-11-07 00:00:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:00:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 3 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:17,103 INFO L225 Difference]: With dead ends: 978 [2024-11-07 00:00:17,103 INFO L226 Difference]: Without dead ends: 563 [2024-11-07 00:00:17,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:00:17,112 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1113 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:17,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 826 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:00:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-07 00:00:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 412. [2024-11-07 00:00:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 379 states have (on average 1.5514511873350922) internal successors, (588), 380 states have internal predecessors, (588), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:00:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 640 transitions. [2024-11-07 00:00:17,221 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 640 transitions. Word has length 199 [2024-11-07 00:00:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:17,221 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 640 transitions. [2024-11-07 00:00:17,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 3 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 640 transitions. [2024-11-07 00:00:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:17,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:17,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:17,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:00:17,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 684497450, now seen corresponding path program 1 times [2024-11-07 00:00:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615843446] [2024-11-07 00:00:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615843446] [2024-11-07 00:00:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615843446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:17,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:17,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:00:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002721605] [2024-11-07 00:00:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:17,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:00:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:00:17,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:00:17,649 INFO L87 Difference]: Start difference. First operand 412 states and 640 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 3 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:20,043 INFO L93 Difference]: Finished difference Result 961 states and 1516 transitions. [2024-11-07 00:00:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:00:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 3 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:20,050 INFO L225 Difference]: With dead ends: 961 [2024-11-07 00:00:20,050 INFO L226 Difference]: Without dead ends: 563 [2024-11-07 00:00:20,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:00:20,052 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 1100 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:20,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 812 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:00:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-07 00:00:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 412. [2024-11-07 00:00:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 379 states have (on average 1.5488126649076517) internal successors, (587), 380 states have internal predecessors, (587), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:00:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 639 transitions. [2024-11-07 00:00:20,101 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 639 transitions. Word has length 199 [2024-11-07 00:00:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:20,102 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 639 transitions. [2024-11-07 00:00:20,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 3 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 639 transitions. [2024-11-07 00:00:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:20,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:20,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:20,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:00:20,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:20,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -839265172, now seen corresponding path program 1 times [2024-11-07 00:00:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:20,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064088639] [2024-11-07 00:00:20,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:20,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:20,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:20,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064088639] [2024-11-07 00:00:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064088639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:00:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534260451] [2024-11-07 00:00:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:00:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:00:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:00:20,600 INFO L87 Difference]: Start difference. First operand 412 states and 639 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 4 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:24,213 INFO L93 Difference]: Finished difference Result 1515 states and 2420 transitions. [2024-11-07 00:00:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:00:24,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 4 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:24,221 INFO L225 Difference]: With dead ends: 1515 [2024-11-07 00:00:24,221 INFO L226 Difference]: Without dead ends: 1124 [2024-11-07 00:00:24,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:24,225 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1663 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:24,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 1394 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 00:00:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-07 00:00:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 822. [2024-11-07 00:00:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 761 states have (on average 1.5597897503285152) internal successors, (1187), 763 states have internal predecessors, (1187), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-07 00:00:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1284 transitions. [2024-11-07 00:00:24,307 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1284 transitions. Word has length 199 [2024-11-07 00:00:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:24,308 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1284 transitions. [2024-11-07 00:00:24,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 4 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1284 transitions. [2024-11-07 00:00:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:24,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:24,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:24,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:00:24,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -608434451, now seen corresponding path program 1 times [2024-11-07 00:00:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:24,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435529296] [2024-11-07 00:00:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:24,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:24,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435529296] [2024-11-07 00:00:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435529296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:24,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298023785] [2024-11-07 00:00:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:24,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:24,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:24,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:24,725 INFO L87 Difference]: Start difference. First operand 822 states and 1284 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:29,698 INFO L93 Difference]: Finished difference Result 2699 states and 4281 transitions. [2024-11-07 00:00:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:00:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:29,711 INFO L225 Difference]: With dead ends: 2699 [2024-11-07 00:00:29,711 INFO L226 Difference]: Without dead ends: 1898 [2024-11-07 00:00:29,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:00:29,716 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 1842 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4853 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 4916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:29,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 2743 Invalid, 4916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4853 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-07 00:00:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-11-07 00:00:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1204. [2024-11-07 00:00:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1115 states have (on average 1.5524663677130044) internal successors, (1731), 1118 states have internal predecessors, (1731), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-07 00:00:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1872 transitions. [2024-11-07 00:00:29,822 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1872 transitions. Word has length 199 [2024-11-07 00:00:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:29,823 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1872 transitions. [2024-11-07 00:00:29,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1872 transitions. [2024-11-07 00:00:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:29,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:29,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:29,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:00:29,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:29,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash -588893329, now seen corresponding path program 1 times [2024-11-07 00:00:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:29,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990801923] [2024-11-07 00:00:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:30,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:30,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990801923] [2024-11-07 00:00:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990801923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003659973] [2024-11-07 00:00:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:30,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:30,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:30,175 INFO L87 Difference]: Start difference. First operand 1204 states and 1872 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:34,850 INFO L93 Difference]: Finished difference Result 4162 states and 6591 transitions. [2024-11-07 00:00:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:00:34,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:34,870 INFO L225 Difference]: With dead ends: 4162 [2024-11-07 00:00:34,870 INFO L226 Difference]: Without dead ends: 2979 [2024-11-07 00:00:34,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:00:34,876 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1836 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4832 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 4897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:34,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 2741 Invalid, 4897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4832 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 00:00:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2024-11-07 00:00:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 1972. [2024-11-07 00:00:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1827 states have (on average 1.5467980295566504) internal successors, (2826), 1832 states have internal predecessors, (2826), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-07 00:00:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3059 transitions. [2024-11-07 00:00:35,005 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 3059 transitions. Word has length 199 [2024-11-07 00:00:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:35,006 INFO L471 AbstractCegarLoop]: Abstraction has 1972 states and 3059 transitions. [2024-11-07 00:00:35,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 3059 transitions. [2024-11-07 00:00:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:35,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:35,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:35,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:00:35,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:35,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash -61499279, now seen corresponding path program 1 times [2024-11-07 00:00:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419931852] [2024-11-07 00:00:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:35,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:35,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:35,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419931852] [2024-11-07 00:00:35,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419931852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:35,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:35,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:35,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093090485] [2024-11-07 00:00:35,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:35,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:35,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:35,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:35,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:35,398 INFO L87 Difference]: Start difference. First operand 1972 states and 3059 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:40,177 INFO L93 Difference]: Finished difference Result 6986 states and 11018 transitions. [2024-11-07 00:00:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:00:40,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:40,204 INFO L225 Difference]: With dead ends: 6986 [2024-11-07 00:00:40,205 INFO L226 Difference]: Without dead ends: 5035 [2024-11-07 00:00:40,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:00:40,213 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1835 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 4884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:40,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 2741 Invalid, 4884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4819 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-07 00:00:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5035 states. [2024-11-07 00:00:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5035 to 3509. [2024-11-07 00:00:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 3252 states have (on average 1.5424354243542435) internal successors, (5016), 3261 states have internal predecessors, (5016), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-07 00:00:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 5439 transitions. [2024-11-07 00:00:40,442 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 5439 transitions. Word has length 199 [2024-11-07 00:00:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:40,443 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 5439 transitions. [2024-11-07 00:00:40,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 5439 transitions. [2024-11-07 00:00:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:40,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:40,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:40,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:00:40,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:40,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1429959889, now seen corresponding path program 1 times [2024-11-07 00:00:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:40,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822475031] [2024-11-07 00:00:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:40,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:40,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822475031] [2024-11-07 00:00:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822475031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:40,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443452791] [2024-11-07 00:00:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:40,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:40,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:40,805 INFO L87 Difference]: Start difference. First operand 3509 states and 5439 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:45,953 INFO L93 Difference]: Finished difference Result 12633 states and 19888 transitions. [2024-11-07 00:00:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:00:45,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:45,989 INFO L225 Difference]: With dead ends: 12633 [2024-11-07 00:00:45,989 INFO L226 Difference]: Without dead ends: 9145 [2024-11-07 00:00:46,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:00:46,004 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1834 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4806 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:46,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 2741 Invalid, 4871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4806 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-07 00:00:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9145 states. [2024-11-07 00:00:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9145 to 6590. [2024-11-07 00:00:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 6109 states have (on average 1.5396955311834997) internal successors, (9406), 6126 states have internal predecessors, (9406), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-07 00:00:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 10227 transitions. [2024-11-07 00:00:46,463 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 10227 transitions. Word has length 199 [2024-11-07 00:00:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:46,467 INFO L471 AbstractCegarLoop]: Abstraction has 6590 states and 10227 transitions. [2024-11-07 00:00:46,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 10227 transitions. [2024-11-07 00:00:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:46,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:46,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:46,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:00:46,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash -781367119, now seen corresponding path program 1 times [2024-11-07 00:00:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525770261] [2024-11-07 00:00:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525770261] [2024-11-07 00:00:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525770261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:46,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:46,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979912515] [2024-11-07 00:00:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:46,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:46,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:46,842 INFO L87 Difference]: Start difference. First operand 6590 states and 10227 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:52,324 INFO L93 Difference]: Finished difference Result 23928 states and 37690 transitions. [2024-11-07 00:00:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:00:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:52,451 INFO L225 Difference]: With dead ends: 23928 [2024-11-07 00:00:52,452 INFO L226 Difference]: Without dead ends: 17359 [2024-11-07 00:00:52,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:00:52,474 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1833 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 4858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:52,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 2741 Invalid, 4858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4793 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-07 00:00:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2024-11-07 00:00:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 12767. [2024-11-07 00:00:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12767 states, 11838 states have (on average 1.538097651630343) internal successors, (18208), 11871 states have internal predecessors, (18208), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 00:00:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 19879 transitions. [2024-11-07 00:00:53,299 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 19879 transitions. Word has length 199 [2024-11-07 00:00:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:53,300 INFO L471 AbstractCegarLoop]: Abstraction has 12767 states and 19879 transitions. [2024-11-07 00:00:53,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 19879 transitions. [2024-11-07 00:00:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:53,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:53,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:53,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:00:53,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:53,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:53,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2010501871, now seen corresponding path program 1 times [2024-11-07 00:00:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632135066] [2024-11-07 00:00:53,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632135066] [2024-11-07 00:00:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632135066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797325553] [2024-11-07 00:00:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:53,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:53,778 INFO L87 Difference]: Start difference. First operand 12767 states and 19879 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:56,687 INFO L93 Difference]: Finished difference Result 30178 states and 47778 transitions. [2024-11-07 00:00:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:00:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:00:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:56,807 INFO L225 Difference]: With dead ends: 30178 [2024-11-07 00:00:56,811 INFO L226 Difference]: Without dead ends: 17432 [2024-11-07 00:00:56,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:00:56,911 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1297 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:56,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1366 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:00:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17432 states. [2024-11-07 00:00:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17432 to 12767. [2024-11-07 00:00:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12767 states, 11838 states have (on average 1.5353100185842203) internal successors, (18175), 11871 states have internal predecessors, (18175), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 00:00:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 19846 transitions. [2024-11-07 00:00:57,996 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 19846 transitions. Word has length 199 [2024-11-07 00:00:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:57,996 INFO L471 AbstractCegarLoop]: Abstraction has 12767 states and 19846 transitions. [2024-11-07 00:00:57,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:00:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 19846 transitions. [2024-11-07 00:00:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:00:58,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:58,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:58,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:00:58,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:58,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2100562161, now seen corresponding path program 1 times [2024-11-07 00:00:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76346576] [2024-11-07 00:00:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:00:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:00:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:00:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:00:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:00:58,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76346576] [2024-11-07 00:00:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76346576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:58,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:00:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437508947] [2024-11-07 00:00:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:58,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:00:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:00:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:00:58,392 INFO L87 Difference]: Start difference. First operand 12767 states and 19846 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:01:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:04,657 INFO L93 Difference]: Finished difference Result 46485 states and 73256 transitions. [2024-11-07 00:01:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:01:04,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:01:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:04,810 INFO L225 Difference]: With dead ends: 46485 [2024-11-07 00:01:04,811 INFO L226 Difference]: Without dead ends: 33739 [2024-11-07 00:01:04,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:01:04,860 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1825 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4755 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 4820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:04,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 2741 Invalid, 4820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4755 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-07 00:01:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33739 states. [2024-11-07 00:01:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33739 to 25185. [2024-11-07 00:01:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25185 states, 23360 states have (on average 1.5336900684931507) internal successors, (35827), 23425 states have internal predecessors, (35827), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-11-07 00:01:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25185 states to 25185 states and 39360 transitions. [2024-11-07 00:01:06,633 INFO L78 Accepts]: Start accepts. Automaton has 25185 states and 39360 transitions. Word has length 199 [2024-11-07 00:01:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:06,634 INFO L471 AbstractCegarLoop]: Abstraction has 25185 states and 39360 transitions. [2024-11-07 00:01:06,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:01:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 25185 states and 39360 transitions. [2024-11-07 00:01:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:01:06,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:06,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:06,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:01:06,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:06,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1410730671, now seen corresponding path program 1 times [2024-11-07 00:01:06,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:06,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160795257] [2024-11-07 00:01:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:06,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:01:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:01:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160795257] [2024-11-07 00:01:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160795257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869465659] [2024-11-07 00:01:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:06,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:06,997 INFO L87 Difference]: Start difference. First operand 25185 states and 39360 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:01:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:10,356 INFO L93 Difference]: Finished difference Result 59234 states and 94161 transitions. [2024-11-07 00:01:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:01:10,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:01:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:10,512 INFO L225 Difference]: With dead ends: 59234 [2024-11-07 00:01:10,513 INFO L226 Difference]: Without dead ends: 34070 [2024-11-07 00:01:10,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:01:10,586 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 1223 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:10,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1367 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:01:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34070 states. [2024-11-07 00:01:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34070 to 25185. [2024-11-07 00:01:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25185 states, 23360 states have (on average 1.5309075342465754) internal successors, (35762), 23425 states have internal predecessors, (35762), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-11-07 00:01:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25185 states to 25185 states and 39295 transitions. [2024-11-07 00:01:12,426 INFO L78 Accepts]: Start accepts. Automaton has 25185 states and 39295 transitions. Word has length 199 [2024-11-07 00:01:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:12,427 INFO L471 AbstractCegarLoop]: Abstraction has 25185 states and 39295 transitions. [2024-11-07 00:01:12,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:01:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 25185 states and 39295 transitions. [2024-11-07 00:01:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:01:12,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:12,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:12,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:01:12,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:12,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 3004721, now seen corresponding path program 1 times [2024-11-07 00:01:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570603250] [2024-11-07 00:01:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:01:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:01:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:12,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:12,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570603250] [2024-11-07 00:01:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570603250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:12,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:12,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:12,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525255585] [2024-11-07 00:01:12,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:12,830 INFO L87 Difference]: Start difference. First operand 25185 states and 39295 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:01:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:01:20,753 INFO L93 Difference]: Finished difference Result 91537 states and 144676 transitions. [2024-11-07 00:01:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:01:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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 199 [2024-11-07 00:01:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:01:21,071 INFO L225 Difference]: With dead ends: 91537 [2024-11-07 00:01:21,072 INFO L226 Difference]: Without dead ends: 66373 [2024-11-07 00:01:21,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:01:21,162 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1819 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 4698 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 4763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:01:21,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 2741 Invalid, 4763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4698 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-07 00:01:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66373 states. [2024-11-07 00:01:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66373 to 50212. [2024-11-07 00:01:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50212 states, 46595 states have (on average 1.5299495654040134) internal successors, (71288), 46724 states have internal predecessors, (71288), 2714 states have call successors, (2714), 774 states have call predecessors, (2714), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-11-07 00:01:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50212 states to 50212 states and 79031 transitions. [2024-11-07 00:01:25,161 INFO L78 Accepts]: Start accepts. Automaton has 50212 states and 79031 transitions. Word has length 199 [2024-11-07 00:01:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:01:25,163 INFO L471 AbstractCegarLoop]: Abstraction has 50212 states and 79031 transitions. [2024-11-07 00:01:25,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:01:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 50212 states and 79031 transitions. [2024-11-07 00:01:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-07 00:01:25,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:01:25,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:01:25,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:01:25,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:01:25,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:01:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1920245709, now seen corresponding path program 1 times [2024-11-07 00:01:25,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:01:25,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580254383] [2024-11-07 00:01:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:01:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:01:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:01:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:01:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-07 00:01:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 00:01:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 00:01:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:01:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:01:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:01:25,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580254383] [2024-11-07 00:01:25,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580254383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:01:25,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:01:25,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:01:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295070114] [2024-11-07 00:01:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:01:25,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:01:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:01:25,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:01:25,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:01:25,597 INFO L87 Difference]: Start difference. First operand 50212 states and 79031 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 5 states have internal predecessors, (189), 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)