./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.01.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.01.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', 'ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe'] 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.01.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 ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:59:22,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:59:22,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:59:22,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:59:22,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:59:23,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:59:23,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:59:23,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:59:23,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:59:23,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:59:23,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:59:23,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:59:23,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:59:23,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:59:23,024 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:59:23,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:59:23,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:59:23,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:59:23,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:59:23,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:59:23,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:59:23,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:59:23,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:59:23,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:59:23,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:59:23,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:59:23,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:59:23,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:59:23,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:59:23,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:59:23,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:59:23,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:59:23,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:59:23,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:59:23,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:59:23,028 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 -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2024-11-06 23:59:23,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:59:23,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:59:23,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:59:23,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:59:23,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:59:23,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2024-11-06 23:59:24,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:59:24,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:59:24,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2024-11-06 23:59:24,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/687f523e9/95ea47b6475e44ca8c9ea9688ca7b5a2/FLAGe289cc834 [2024-11-06 23:59:24,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/687f523e9/95ea47b6475e44ca8c9ea9688ca7b5a2 [2024-11-06 23:59:24,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:59:24,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:59:24,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:59:24,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:59:24,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:59:24,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:24,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b13b48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24, skipping insertion in model container [2024-11-06 23:59:24,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:24,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:59:24,900 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.01.cil.c[706,719] [2024-11-06 23:59:24,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:59:24,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:59:24,965 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.01.cil.c[706,719] [2024-11-06 23:59:24,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:59:24,996 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:59:24,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24 WrapperNode [2024-11-06 23:59:24,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:59:24,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:59:24,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:59:24,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:59:25,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,037 INFO L138 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 212 [2024-11-06 23:59:25,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:59:25,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:59:25,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:59:25,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:59:25,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,067 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 23:59:25,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:59:25,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:59:25,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:59:25,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:59:25,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (1/1) ... [2024-11-06 23:59:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:59:25,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:25,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:59:25,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:59:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:59:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-06 23:59:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-06 23:59:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-06 23:59:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-06 23:59:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-06 23:59:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-06 23:59:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-06 23:59:25,160 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-06 23:59:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:59:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-06 23:59:25,161 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-06 23:59:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:59:25,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:59:25,232 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:59:25,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:59:25,514 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-06 23:59:25,518 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:59:25,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:59:25,531 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-06 23:59:25,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:25 BoogieIcfgContainer [2024-11-06 23:59:25,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:59:25,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:59:25,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:59:25,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:59:25,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:59:24" (1/3) ... [2024-11-06 23:59:25,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c7a421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:59:25, skipping insertion in model container [2024-11-06 23:59:25,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:24" (2/3) ... [2024-11-06 23:59:25,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c7a421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:59:25, skipping insertion in model container [2024-11-06 23:59:25,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:25" (3/3) ... [2024-11-06 23:59:25,542 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2024-11-06 23:59:25,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:59:25,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:59:25,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:59:25,613 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;@d07de74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:59:25,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:59:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 84 states have internal predecessors, (124), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-06 23:59:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:25,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:25,627 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] [2024-11-06 23:59:25,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 570033615, now seen corresponding path program 1 times [2024-11-06 23:59:25,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:25,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132451269] [2024-11-06 23:59:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:26,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132451269] [2024-11-06 23:59:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132451269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:26,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202251365] [2024-11-06 23:59:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:26,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:26,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:26,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:26,086 INFO L87 Difference]: Start difference. First operand has 102 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 84 states have internal predecessors, (124), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:26,568 INFO L93 Difference]: Finished difference Result 214 states and 322 transitions. [2024-11-06 23:59:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:59:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2024-11-06 23:59:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:26,578 INFO L225 Difference]: With dead ends: 214 [2024-11-06 23:59:26,578 INFO L226 Difference]: Without dead ends: 117 [2024-11-06 23:59:26,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:26,583 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 209 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:26,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 328 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:59:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-06 23:59:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2024-11-06 23:59:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 79 states have internal predecessors, (107), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-06 23:59:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-11-06 23:59:26,637 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 55 [2024-11-06 23:59:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:26,637 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-11-06 23:59:26,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-11-06 23:59:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:26,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:26,640 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] [2024-11-06 23:59:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:59:26,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -327359663, now seen corresponding path program 1 times [2024-11-06 23:59:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209519927] [2024-11-06 23:59:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:26,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209519927] [2024-11-06 23:59:26,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209519927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:26,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811468935] [2024-11-06 23:59:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:26,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:26,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:26,867 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:27,505 INFO L93 Difference]: Finished difference Result 340 states and 483 transitions. [2024-11-06 23:59:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:59:27,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2024-11-06 23:59:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:27,508 INFO L225 Difference]: With dead ends: 340 [2024-11-06 23:59:27,508 INFO L226 Difference]: Without dead ends: 252 [2024-11-06 23:59:27,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:59:27,510 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 347 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:27,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 612 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 23:59:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-06 23:59:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 179. [2024-11-06 23:59:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 144 states have (on average 1.3819444444444444) internal successors, (199), 147 states have internal predecessors, (199), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-06 23:59:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2024-11-06 23:59:27,551 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 55 [2024-11-06 23:59:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:27,552 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2024-11-06 23:59:27,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2024-11-06 23:59:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:27,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:27,554 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] [2024-11-06 23:59:27,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:59:27,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:27,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash -79213169, now seen corresponding path program 1 times [2024-11-06 23:59:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065983455] [2024-11-06 23:59:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:27,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:27,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:27,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065983455] [2024-11-06 23:59:27,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065983455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:27,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:27,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:59:27,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175060626] [2024-11-06 23:59:27,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:59:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:59:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:27,701 INFO L87 Difference]: Start difference. First operand 179 states and 250 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:28,213 INFO L93 Difference]: Finished difference Result 467 states and 654 transitions. [2024-11-06 23:59:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:59:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 55 [2024-11-06 23:59:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:28,216 INFO L225 Difference]: With dead ends: 467 [2024-11-06 23:59:28,216 INFO L226 Difference]: Without dead ends: 299 [2024-11-06 23:59:28,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-06 23:59:28,222 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 358 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:28,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 461 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:59:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-06 23:59:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2024-11-06 23:59:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 201 states have (on average 1.36318407960199) internal successors, (274), 205 states have internal predecessors, (274), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2024-11-06 23:59:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 343 transitions. [2024-11-06 23:59:28,255 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 343 transitions. Word has length 55 [2024-11-06 23:59:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:28,255 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 343 transitions. [2024-11-06 23:59:28,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 343 transitions. [2024-11-06 23:59:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:28,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:28,257 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] [2024-11-06 23:59:28,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:59:28,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:28,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1046046800, now seen corresponding path program 1 times [2024-11-06 23:59:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:28,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523221867] [2024-11-06 23:59:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:28,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523221867] [2024-11-06 23:59:28,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523221867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:28,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:28,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:28,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875759910] [2024-11-06 23:59:28,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:28,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:28,362 INFO L87 Difference]: Start difference. First operand 250 states and 343 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:28,702 INFO L93 Difference]: Finished difference Result 518 states and 721 transitions. [2024-11-06 23:59:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 23:59:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2024-11-06 23:59:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:28,705 INFO L225 Difference]: With dead ends: 518 [2024-11-06 23:59:28,705 INFO L226 Difference]: Without dead ends: 279 [2024-11-06 23:59:28,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:28,708 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 96 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:28,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 439 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:59:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-06 23:59:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 253. [2024-11-06 23:59:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 204 states have (on average 1.3480392156862746) internal successors, (275), 208 states have internal predecessors, (275), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2024-11-06 23:59:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 344 transitions. [2024-11-06 23:59:28,744 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 344 transitions. Word has length 55 [2024-11-06 23:59:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:28,744 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 344 transitions. [2024-11-06 23:59:28,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 344 transitions. [2024-11-06 23:59:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:28,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:28,747 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] [2024-11-06 23:59:28,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:59:28,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:28,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 973660242, now seen corresponding path program 1 times [2024-11-06 23:59:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:28,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518575264] [2024-11-06 23:59:28,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:28,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518575264] [2024-11-06 23:59:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518575264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070238156] [2024-11-06 23:59:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:28,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:28,877 INFO L87 Difference]: Start difference. First operand 253 states and 344 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:29,221 INFO L93 Difference]: Finished difference Result 533 states and 735 transitions. [2024-11-06 23:59:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 23:59:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2024-11-06 23:59:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:29,224 INFO L225 Difference]: With dead ends: 533 [2024-11-06 23:59:29,224 INFO L226 Difference]: Without dead ends: 291 [2024-11-06 23:59:29,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:59:29,226 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 100 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:29,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 435 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:59:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-06 23:59:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 262. [2024-11-06 23:59:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.3333333333333333) internal successors, (284), 217 states have internal predecessors, (284), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2024-11-06 23:59:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2024-11-06 23:59:29,256 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 55 [2024-11-06 23:59:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:29,256 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2024-11-06 23:59:29,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2024-11-06 23:59:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:29,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:29,258 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] [2024-11-06 23:59:29,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:59:29,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:29,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1398079020, now seen corresponding path program 1 times [2024-11-06 23:59:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:29,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118853271] [2024-11-06 23:59:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118853271] [2024-11-06 23:59:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118853271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:29,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:29,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626491406] [2024-11-06 23:59:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:29,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:29,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:29,369 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:29,835 INFO L93 Difference]: Finished difference Result 668 states and 901 transitions. [2024-11-06 23:59:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 23:59:29,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-06 23:59:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:29,839 INFO L225 Difference]: With dead ends: 668 [2024-11-06 23:59:29,840 INFO L226 Difference]: Without dead ends: 486 [2024-11-06 23:59:29,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-06 23:59:29,841 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 308 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:29,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 412 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-06 23:59:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 421. [2024-11-06 23:59:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 347 states have (on average 1.319884726224784) internal successors, (458), 353 states have internal predecessors, (458), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2024-11-06 23:59:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 553 transitions. [2024-11-06 23:59:29,879 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 553 transitions. Word has length 55 [2024-11-06 23:59:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:29,880 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 553 transitions. [2024-11-06 23:59:29,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 553 transitions. [2024-11-06 23:59:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:29,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:29,881 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] [2024-11-06 23:59:29,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:59:29,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:29,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1091449942, now seen corresponding path program 1 times [2024-11-06 23:59:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693721755] [2024-11-06 23:59:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:29,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693721755] [2024-11-06 23:59:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693721755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:29,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:29,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947243700] [2024-11-06 23:59:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:29,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:29,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:29,999 INFO L87 Difference]: Start difference. First operand 421 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:30,257 INFO L93 Difference]: Finished difference Result 868 states and 1146 transitions. [2024-11-06 23:59:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:59:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-06 23:59:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:30,262 INFO L225 Difference]: With dead ends: 868 [2024-11-06 23:59:30,262 INFO L226 Difference]: Without dead ends: 458 [2024-11-06 23:59:30,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:59:30,265 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 234 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:30,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 306 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:59:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-06 23:59:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 420. [2024-11-06 23:59:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 346 states have (on average 1.2861271676300579) internal successors, (445), 352 states have internal predecessors, (445), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2024-11-06 23:59:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 540 transitions. [2024-11-06 23:59:30,305 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 540 transitions. Word has length 55 [2024-11-06 23:59:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:30,308 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 540 transitions. [2024-11-06 23:59:30,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 540 transitions. [2024-11-06 23:59:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:59:30,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:30,309 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] [2024-11-06 23:59:30,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:59:30,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:30,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1310304660, now seen corresponding path program 1 times [2024-11-06 23:59:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338899272] [2024-11-06 23:59:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:30,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338899272] [2024-11-06 23:59:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338899272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:30,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:30,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:59:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167513401] [2024-11-06 23:59:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:30,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:59:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:59:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:30,390 INFO L87 Difference]: Start difference. First operand 420 states and 540 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:30,756 INFO L93 Difference]: Finished difference Result 1275 states and 1659 transitions. [2024-11-06 23:59:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:59:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-06 23:59:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:30,761 INFO L225 Difference]: With dead ends: 1275 [2024-11-06 23:59:30,762 INFO L226 Difference]: Without dead ends: 866 [2024-11-06 23:59:30,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-06 23:59:30,764 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 283 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:30,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 367 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-06 23:59:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 804. [2024-11-06 23:59:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 661 states have (on average 1.2692889561270801) internal successors, (839), 672 states have internal predecessors, (839), 85 states have call successors, (85), 50 states have call predecessors, (85), 57 states have return successors, (113), 85 states have call predecessors, (113), 85 states have call successors, (113) [2024-11-06 23:59:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1037 transitions. [2024-11-06 23:59:30,826 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1037 transitions. Word has length 55 [2024-11-06 23:59:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:30,826 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1037 transitions. [2024-11-06 23:59:30,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1037 transitions. [2024-11-06 23:59:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-06 23:59:30,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:30,827 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] [2024-11-06 23:59:30,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:59:30,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:30,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash 970501815, now seen corresponding path program 1 times [2024-11-06 23:59:30,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714166401] [2024-11-06 23:59:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:30,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714166401] [2024-11-06 23:59:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714166401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:30,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:59:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699932506] [2024-11-06 23:59:30,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:59:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:30,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:59:30,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:59:30,872 INFO L87 Difference]: Start difference. First operand 804 states and 1037 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:31,103 INFO L93 Difference]: Finished difference Result 1467 states and 1870 transitions. [2024-11-06 23:59:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:59:31,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 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 56 [2024-11-06 23:59:31,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:31,107 INFO L225 Difference]: With dead ends: 1467 [2024-11-06 23:59:31,108 INFO L226 Difference]: Without dead ends: 674 [2024-11-06 23:59:31,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:59:31,110 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 227 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:31,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 193 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 23:59:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-06 23:59:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 618. [2024-11-06 23:59:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 515 states have (on average 1.2563106796116505) internal successors, (647), 523 states have internal predecessors, (647), 60 states have call successors, (60), 37 states have call predecessors, (60), 42 states have return successors, (75), 59 states have call predecessors, (75), 60 states have call successors, (75) [2024-11-06 23:59:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 782 transitions. [2024-11-06 23:59:31,150 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 782 transitions. Word has length 56 [2024-11-06 23:59:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:31,150 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 782 transitions. [2024-11-06 23:59:31,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 782 transitions. [2024-11-06 23:59:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 23:59:31,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:31,151 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] [2024-11-06 23:59:31,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:59:31,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:31,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1391020897, now seen corresponding path program 1 times [2024-11-06 23:59:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310295530] [2024-11-06 23:59:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310295530] [2024-11-06 23:59:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310295530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:59:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869620861] [2024-11-06 23:59:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:31,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:59:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:31,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:59:31,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:59:31,208 INFO L87 Difference]: Start difference. First operand 618 states and 782 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 23:59:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:31,551 INFO L93 Difference]: Finished difference Result 1868 states and 2358 transitions. [2024-11-06 23:59:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 23:59:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-11-06 23:59:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:31,560 INFO L225 Difference]: With dead ends: 1868 [2024-11-06 23:59:31,560 INFO L226 Difference]: Without dead ends: 1260 [2024-11-06 23:59:31,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:59:31,562 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 282 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:31,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 251 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:59:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-11-06 23:59:31,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1154. [2024-11-06 23:59:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 953 states have (on average 1.229800629590766) internal successors, (1172), 968 states have internal predecessors, (1172), 116 states have call successors, (116), 74 states have call predecessors, (116), 84 states have return successors, (145), 113 states have call predecessors, (145), 116 states have call successors, (145) [2024-11-06 23:59:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1433 transitions. [2024-11-06 23:59:31,651 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1433 transitions. Word has length 57 [2024-11-06 23:59:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:31,652 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1433 transitions. [2024-11-06 23:59:31,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 23:59:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1433 transitions. [2024-11-06 23:59:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-06 23:59:31,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:31,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:31,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 23:59:31,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:31,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash 802104282, now seen corresponding path program 1 times [2024-11-06 23:59:31,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:31,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820533615] [2024-11-06 23:59:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-06 23:59:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 23:59:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 23:59:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-06 23:59:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 23:59:31,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:31,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820533615] [2024-11-06 23:59:31,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820533615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:31,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:59:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426342655] [2024-11-06 23:59:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:31,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:59:31,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:31,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:59:31,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:31,754 INFO L87 Difference]: Start difference. First operand 1154 states and 1433 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 23:59:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:32,447 INFO L93 Difference]: Finished difference Result 3549 states and 4417 transitions. [2024-11-06 23:59:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 23:59:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2024-11-06 23:59:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:32,458 INFO L225 Difference]: With dead ends: 3549 [2024-11-06 23:59:32,458 INFO L226 Difference]: Without dead ends: 1851 [2024-11-06 23:59:32,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:59:32,463 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 492 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:32,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 510 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:59:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2024-11-06 23:59:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1744. [2024-11-06 23:59:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1436 states have (on average 1.217966573816156) internal successors, (1749), 1467 states have internal predecessors, (1749), 172 states have call successors, (172), 111 states have call predecessors, (172), 135 states have return successors, (252), 167 states have call predecessors, (252), 172 states have call successors, (252) [2024-11-06 23:59:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2173 transitions. [2024-11-06 23:59:32,600 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2173 transitions. Word has length 76 [2024-11-06 23:59:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:32,600 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2173 transitions. [2024-11-06 23:59:32,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 23:59:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2173 transitions. [2024-11-06 23:59:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 23:59:32,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:32,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 23:59:32,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:32,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1940125613, now seen corresponding path program 1 times [2024-11-06 23:59:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444491566] [2024-11-06 23:59:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:59:32,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 23:59:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:59:32,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 23:59:32,657 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 23:59:32,658 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 23:59:32,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 23:59:32,662 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:32,755 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 23:59:32,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:59:32 BoogieIcfgContainer [2024-11-06 23:59:32,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 23:59:32,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 23:59:32,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 23:59:32,759 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 23:59:32,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:25" (3/4) ... [2024-11-06 23:59:32,761 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 23:59:32,841 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 23:59:32,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 23:59:32,843 INFO L158 Benchmark]: Toolchain (without parser) took 8079.52ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 91.4MB in the beginning and 151.2MB in the end (delta: -59.8MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-06 23:59:32,843 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:59:32,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.45ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 78.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:59:32,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.13ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:59:32,844 INFO L158 Benchmark]: Boogie Preprocessor took 56.60ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:59:32,844 INFO L158 Benchmark]: RCFGBuilder took 432.17ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 58.4MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:59:32,845 INFO L158 Benchmark]: TraceAbstraction took 7225.50ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 57.9MB in the beginning and 157.2MB in the end (delta: -99.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-11-06 23:59:32,845 INFO L158 Benchmark]: Witness Printer took 82.90ms. Allocated memory is still 192.9MB. Free memory was 157.2MB in the beginning and 151.2MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:59:32,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.79ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.45ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 78.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.13ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.60ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 432.17ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 58.4MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7225.50ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 57.9MB in the beginning and 157.2MB in the end (delta: -99.3MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Witness Printer took 82.90ms. Allocated memory is still 192.9MB. Free memory was 157.2MB in the beginning and 151.2MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; VAL [E_1=2, M_E=2, T1_E=2, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L400] RET activate_threads() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, T1_E=2, \old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \result=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() [L201] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [E_1=2, M_E=2, T1_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [E_1=2, M_E=2, T1_E=2, \result=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [E_1=1, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L322] RET activate_threads() VAL [E_1=1, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, T1_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3043 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2936 mSDsluCounter, 4314 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3140 mSDsCounter, 471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3506 IncrementalHoareTripleChecker+Invalid, 3977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 471 mSolverCounterUnsat, 1174 mSDtfsCounter, 3506 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1744occurred in iteration=11, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 631 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-06 23:59:32,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE