./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i --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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i', '-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', 'a4661a79f995ce83b554327eb89182f2e104b0cd28a9d1560990b967de8c220f'] 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i -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 a4661a79f995ce83b554327eb89182f2e104b0cd28a9d1560990b967de8c220f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:46:44,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:46:44,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:46:44,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:46:44,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:46:44,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:46:44,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:46:44,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:46:44,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:46:44,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:46:44,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:46:44,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:46:44,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:46:44,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:46:44,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:46:44,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:46:44,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:44,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:46:44,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:46:44,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:46:44,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:46:44,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:46:44,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:46:44,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:46:44,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:46:44,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:46:44,354 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 -> a4661a79f995ce83b554327eb89182f2e104b0cd28a9d1560990b967de8c220f [2024-11-07 07:46:44,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:46:44,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:46:44,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:46:44,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:46:44,639 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:46:44,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2024-11-07 07:46:45,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:46:46,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:46:46,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2024-11-07 07:46:46,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bcbffdac/7a0210c1aae243b880e18163440d749b/FLAGf59f51c3b [2024-11-07 07:46:46,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bcbffdac/7a0210c1aae243b880e18163440d749b [2024-11-07 07:46:46,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:46:46,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:46:46,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:46,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:46:46,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:46:46,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ef2a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46, skipping insertion in model container [2024-11-07 07:46:46,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:46:46,534 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i[915,928] [2024-11-07 07:46:46,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:46,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:46:46,576 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i[915,928] [2024-11-07 07:46:46,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:46,601 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:46:46,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46 WrapperNode [2024-11-07 07:46:46,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:46,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:46,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:46:46,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:46:46,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,645 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-07 07:46:46,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:46,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:46:46,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:46:46,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:46:46,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:46:46,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:46:46,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:46:46,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:46:46,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:46:46,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (1/1) ... [2024-11-07 07:46:46,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:46,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:46:46,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:46:46,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:46:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:46:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:46:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:46:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:46:46,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:46:46,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:46:46,802 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:46:46,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:46:47,006 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:46:47,006 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:46:47,014 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:46:47,015 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:46:47,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:47 BoogieIcfgContainer [2024-11-07 07:46:47,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:46:47,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:46:47,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:46:47,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:46:47,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:46:46" (1/3) ... [2024-11-07 07:46:47,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393af862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:47, skipping insertion in model container [2024-11-07 07:46:47,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:46" (2/3) ... [2024-11-07 07:46:47,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393af862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:47, skipping insertion in model container [2024-11-07 07:46:47,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:47" (3/3) ... [2024-11-07 07:46:47,032 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-3.i [2024-11-07 07:46:47,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:46:47,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:46:47,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:46:47,099 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;@453577bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:46:47,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:46:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:46:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 07:46:47,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:47,116 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:47,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:47,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1541050139, now seen corresponding path program 1 times [2024-11-07 07:46:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:47,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481520365] [2024-11-07 07:46:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481520365] [2024-11-07 07:46:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481520365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:47,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:47,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:46:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383734102] [2024-11-07 07:46:47,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:47,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:46:47,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:46:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:46:47,432 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 07:46:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:47,447 INFO L93 Difference]: Finished difference Result 105 states and 182 transitions. [2024-11-07 07:46:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:46:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-07 07:46:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:47,458 INFO L225 Difference]: With dead ends: 105 [2024-11-07 07:46:47,458 INFO L226 Difference]: Without dead ends: 52 [2024-11-07 07:46:47,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:46:47,466 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:47,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:46:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-07 07:46:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-07 07:46:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:46:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2024-11-07 07:46:47,491 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 124 [2024-11-07 07:46:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:47,492 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2024-11-07 07:46:47,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 07:46:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2024-11-07 07:46:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 07:46:47,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:47,494 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:47,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:46:47,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:47,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:47,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1582704411, now seen corresponding path program 1 times [2024-11-07 07:46:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:47,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46198962] [2024-11-07 07:46:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:47,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:47,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46198962] [2024-11-07 07:46:47,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46198962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:47,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:47,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:46:47,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557412320] [2024-11-07 07:46:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:46:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:47,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:46:47,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:46:47,879 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:47,911 INFO L93 Difference]: Finished difference Result 150 states and 225 transitions. [2024-11-07 07:46:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:46:47,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2024-11-07 07:46:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:47,913 INFO L225 Difference]: With dead ends: 150 [2024-11-07 07:46:47,913 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 07:46:47,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:46:47,914 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:47,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:46:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 07:46:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-07 07:46:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 147 transitions. [2024-11-07 07:46:47,933 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 147 transitions. Word has length 124 [2024-11-07 07:46:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 147 transitions. [2024-11-07 07:46:47,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2024-11-07 07:46:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 07:46:47,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:47,936 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:47,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:46:47,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:47,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1639962713, now seen corresponding path program 1 times [2024-11-07 07:46:47,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:47,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956076728] [2024-11-07 07:46:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:46:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956076728] [2024-11-07 07:46:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956076728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:46:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192395463] [2024-11-07 07:46:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:48,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:46:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:46:48,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:46:48,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:46:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:48,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:46:48,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:46:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-07 07:46:48,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:46:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:46:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192395463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:46:48,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:46:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 07:46:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588307217] [2024-11-07 07:46:48,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:46:48,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:46:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:46:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:46:48,910 INFO L87 Difference]: Start difference. First operand 98 states and 147 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 07:46:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:49,087 INFO L93 Difference]: Finished difference Result 209 states and 305 transitions. [2024-11-07 07:46:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:46:49,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 124 [2024-11-07 07:46:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:49,091 INFO L225 Difference]: With dead ends: 209 [2024-11-07 07:46:49,091 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 07:46:49,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:46:49,092 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:49,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 115 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 07:46:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2024-11-07 07:46:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-11-07 07:46:49,121 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 124 [2024-11-07 07:46:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-11-07 07:46:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 07:46:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-11-07 07:46:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 07:46:49,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:49,123 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:49,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:46:49,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:46:49,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:49,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1641809755, now seen corresponding path program 1 times [2024-11-07 07:46:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388542852] [2024-11-07 07:46:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:51,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:51,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388542852] [2024-11-07 07:46:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388542852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:51,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:51,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:46:51,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017479247] [2024-11-07 07:46:51,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:46:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:51,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:46:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:46:51,650 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:51,913 INFO L93 Difference]: Finished difference Result 132 states and 180 transitions. [2024-11-07 07:46:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:46:51,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2024-11-07 07:46:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:51,915 INFO L225 Difference]: With dead ends: 132 [2024-11-07 07:46:51,915 INFO L226 Difference]: Without dead ends: 130 [2024-11-07 07:46:51,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:46:51,916 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 25 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:51,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 380 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-07 07:46:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2024-11-07 07:46:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 66 states have internal predecessors, (76), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-11-07 07:46:51,932 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 124 [2024-11-07 07:46:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:51,932 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-11-07 07:46:51,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-11-07 07:46:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 07:46:51,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:51,934 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:51,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:46:51,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:51,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1190332772, now seen corresponding path program 1 times [2024-11-07 07:46:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:51,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225067951] [2024-11-07 07:46:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:53,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225067951] [2024-11-07 07:46:53,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225067951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:46:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000649181] [2024-11-07 07:46:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:53,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:46:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:46:53,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:46:53,119 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:53,284 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2024-11-07 07:46:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:46:53,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-07 07:46:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:53,286 INFO L225 Difference]: With dead ends: 155 [2024-11-07 07:46:53,286 INFO L226 Difference]: Without dead ends: 153 [2024-11-07 07:46:53,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:46:53,287 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:53,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 480 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-07 07:46:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 117. [2024-11-07 07:46:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 72 states have internal predecessors, (86), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-07 07:46:53,300 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 125 [2024-11-07 07:46:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:53,300 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-07 07:46:53,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-07 07:46:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 07:46:53,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:53,303 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:53,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:46:53,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:53,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1247591074, now seen corresponding path program 1 times [2024-11-07 07:46:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78654365] [2024-11-07 07:46:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:54,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78654365] [2024-11-07 07:46:54,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78654365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:54,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:54,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:46:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982003353] [2024-11-07 07:46:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:54,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:46:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:46:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:46:54,288 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:54,523 INFO L93 Difference]: Finished difference Result 154 states and 206 transitions. [2024-11-07 07:46:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:46:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-07 07:46:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:54,525 INFO L225 Difference]: With dead ends: 154 [2024-11-07 07:46:54,525 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 07:46:54,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:46:54,526 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 37 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:54,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 535 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 07:46:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2024-11-07 07:46:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 72 states have internal predecessors, (86), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-07 07:46:54,548 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 125 [2024-11-07 07:46:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:54,549 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-07 07:46:54,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-07 07:46:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 07:46:54,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:54,550 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:46:54,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1329627162, now seen corresponding path program 1 times [2024-11-07 07:46:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255180088] [2024-11-07 07:46:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255180088] [2024-11-07 07:46:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255180088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:46:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120984925] [2024-11-07 07:46:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:55,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:46:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:55,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:46:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:46:55,191 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:55,326 INFO L93 Difference]: Finished difference Result 161 states and 214 transitions. [2024-11-07 07:46:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:46:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-07 07:46:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:55,328 INFO L225 Difference]: With dead ends: 161 [2024-11-07 07:46:55,329 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 07:46:55,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:46:55,330 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 45 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:55,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 381 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 07:46:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2024-11-07 07:46:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 72 states have internal predecessors, (86), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-07 07:46:55,349 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 125 [2024-11-07 07:46:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:55,349 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-07 07:46:55,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-07 07:46:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 07:46:55,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:55,351 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:55,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:46:55,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:55,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:55,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1272368860, now seen corresponding path program 1 times [2024-11-07 07:46:55,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:55,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506025000] [2024-11-07 07:46:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:56,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:56,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506025000] [2024-11-07 07:46:56,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506025000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:56,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:56,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:46:56,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223239090] [2024-11-07 07:46:56,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:56,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:46:56,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:56,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:46:56,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:46:56,322 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:56,569 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2024-11-07 07:46:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:46:56,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-07 07:46:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:56,572 INFO L225 Difference]: With dead ends: 147 [2024-11-07 07:46:56,572 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 07:46:56,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:46:56,572 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:56,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 527 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 07:46:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2024-11-07 07:46:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-07 07:46:56,589 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 125 [2024-11-07 07:46:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:56,590 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-07 07:46:56,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-07 07:46:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 07:46:56,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:56,591 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:56,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:46:56,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:56,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1284277938, now seen corresponding path program 1 times [2024-11-07 07:46:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270962199] [2024-11-07 07:46:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:46:56,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:56,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270962199] [2024-11-07 07:46:56,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270962199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:56,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:56,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:46:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617405639] [2024-11-07 07:46:56,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:56,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:46:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:56,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:46:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:46:56,716 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:56,861 INFO L93 Difference]: Finished difference Result 234 states and 330 transitions. [2024-11-07 07:46:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:46:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-11-07 07:46:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:56,863 INFO L225 Difference]: With dead ends: 234 [2024-11-07 07:46:56,863 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 07:46:56,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:46:56,864 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 49 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:56,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 204 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 07:46:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2024-11-07 07:46:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 68 states have internal predecessors, (78), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2024-11-07 07:46:56,876 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 126 [2024-11-07 07:46:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:56,876 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2024-11-07 07:46:56,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2024-11-07 07:46:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-07 07:46:56,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:56,880 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:56,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:46:56,880 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:56,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2051367630, now seen corresponding path program 1 times [2024-11-07 07:46:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051088290] [2024-11-07 07:46:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:56,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:46:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:46:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 07:46:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:46:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 07:46:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:46:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 07:46:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 07:46:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 07:46:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 07:46:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 07:46:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 07:46:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 07:46:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-07 07:46:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 07:46:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 07:46:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 07:46:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 07:46:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 07:46:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-07 07:46:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-07 07:46:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 07:46:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3161 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3154 trivial. 0 not checked. [2024-11-07 07:46:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051088290] [2024-11-07 07:46:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051088290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 07:46:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095911480] [2024-11-07 07:46:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:46:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:46:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:46:57,547 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:57,730 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2024-11-07 07:46:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:46:57,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 248 [2024-11-07 07:46:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:57,732 INFO L225 Difference]: With dead ends: 154 [2024-11-07 07:46:57,732 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 07:46:57,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:46:57,733 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 42 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:57,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 441 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 07:46:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 07:46:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 07:46:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 07:46:57,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2024-11-07 07:46:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:57,735 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 07:46:57,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:46:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 07:46:57,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 07:46:57,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:46:57,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:46:57,743 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:57,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 07:46:58,189 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:46:58,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:46:58 BoogieIcfgContainer [2024-11-07 07:46:58,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:46:58,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:46:58,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:46:58,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:46:58,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:47" (3/4) ... [2024-11-07 07:46:58,205 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 07:46:58,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 07:46:58,215 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 07:46:58,215 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 07:46:58,216 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 07:46:58,216 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 07:46:58,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 07:46:58,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 07:46:58,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:46:58,284 INFO L158 Benchmark]: Toolchain (without parser) took 11867.16ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 84.9MB in the beginning and 435.2MB in the end (delta: -350.3MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. [2024-11-07 07:46:58,284 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:46:58,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.03ms. Allocated memory is still 109.1MB. Free memory was 84.6MB in the beginning and 71.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:46:58,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.39ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 70.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:46:58,285 INFO L158 Benchmark]: Boogie Preprocessor took 50.67ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 67.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:46:58,285 INFO L158 Benchmark]: RCFGBuilder took 316.25ms. Allocated memory is still 109.1MB. Free memory was 67.6MB in the beginning and 52.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:46:58,285 INFO L158 Benchmark]: TraceAbstraction took 11180.39ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 52.0MB in the beginning and 439.3MB in the end (delta: -387.3MB). Peak memory consumption was 341.8MB. Max. memory is 16.1GB. [2024-11-07 07:46:58,285 INFO L158 Benchmark]: Witness Printer took 80.21ms. Allocated memory is still 629.1MB. Free memory was 439.3MB in the beginning and 435.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:46:58,286 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.68ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.03ms. Allocated memory is still 109.1MB. Free memory was 84.6MB in the beginning and 71.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.39ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 70.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.67ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 67.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.25ms. Allocated memory is still 109.1MB. Free memory was 67.6MB in the beginning and 52.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11180.39ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 52.0MB in the beginning and 439.3MB in the end (delta: -387.3MB). Peak memory consumption was 341.8MB. Max. memory is 16.1GB. * Witness Printer took 80.21ms. Allocated memory is still 629.1MB. Free memory was 439.3MB in the beginning and 435.2MB in the end (delta: 4.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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 10, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 3282 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2504 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1065 IncrementalHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 778 mSDtfsCounter, 1065 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 798 GetRequests, 729 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=5, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 180 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1494 NumberOfCodeBlocks, 1494 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 3679 SizeOfPredicates, 1 NumberOfNonLiveVariables, 281 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 11359/11521 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (var_1_4 == 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 07:46:58,311 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 Result: TRUE