./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.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_variablewrapping_wrapper-s_file-67.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', 'd61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0'] 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_variablewrapping_wrapper-s_file-67.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 d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:48:09,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:48:09,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:48:09,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:48:09,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:48:09,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:48:09,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:48:09,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:48:09,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:48:09,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:48:09,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:48:09,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:48:09,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:48:09,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:48:09,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:48:09,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:48:09,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:48:09,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:48:09,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:48:09,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:48:09,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:48:09,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:48:09,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:09,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:48:09,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:48:09,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:48:09,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:48:09,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:48:09,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:48:09,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:48:09,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:48:09,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:48:09,683 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 -> d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 [2024-11-07 10:48:09,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:48:09,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:48:09,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:48:09,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:48:09,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:48:09,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.i [2024-11-07 10:48:11,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:48:11,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:48:11,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.i [2024-11-07 10:48:11,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39bd65b0b/0443afa9e1aa443199c6a81c65055bb4/FLAGe9f3e480e [2024-11-07 10:48:11,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39bd65b0b/0443afa9e1aa443199c6a81c65055bb4 [2024-11-07 10:48:11,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:48:11,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:48:11,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:11,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:48:11,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:48:11,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:11,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b2762b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11, skipping insertion in model container [2024-11-07 10:48:11,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:11,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:48:11,756 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_variablewrapping_wrapper-s_file-67.i[916,929] [2024-11-07 10:48:11,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:11,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:48:11,830 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_variablewrapping_wrapper-s_file-67.i[916,929] [2024-11-07 10:48:11,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:11,903 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:48:11,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11 WrapperNode [2024-11-07 10:48:11,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:11,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:11,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:48:11,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:48:11,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:11,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:11,982 INFO L138 Inliner]: procedures = 30, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 401 [2024-11-07 10:48:11,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:11,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:48:11,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:48:11,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:48:11,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:11,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:11,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,008 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:48:12,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:48:12,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:48:12,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:48:12,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:48:12,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (1/1) ... [2024-11-07 10:48:12,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:48:12,091 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 10:48:12,094 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 10:48:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:48:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:48:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:48:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:48:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:48:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:48:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:48:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:48:12,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:48:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:48:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:48:12,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:48:12,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:48:12,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:48:12,684 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-07 10:48:12,685 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:48:12,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:48:12,699 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:48:12,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:12 BoogieIcfgContainer [2024-11-07 10:48:12,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:48:12,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:48:12,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:48:12,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:48:12,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:48:11" (1/3) ... [2024-11-07 10:48:12,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e623331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:48:12, skipping insertion in model container [2024-11-07 10:48:12,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:11" (2/3) ... [2024-11-07 10:48:12,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e623331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:48:12, skipping insertion in model container [2024-11-07 10:48:12,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:12" (3/3) ... [2024-11-07 10:48:12,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-67.i [2024-11-07 10:48:12,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:48:12,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:48:12,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:48:12,787 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;@7f164eaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:48:12,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:48:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:48:12,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:12,806 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:12,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 742144131, now seen corresponding path program 1 times [2024-11-07 10:48:12,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694015079] [2024-11-07 10:48:12,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694015079] [2024-11-07 10:48:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694015079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:13,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:13,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:48:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500428563] [2024-11-07 10:48:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:48:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:48:13,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:48:13,269 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:13,300 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-11-07 10:48:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:48:13,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-07 10:48:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:13,309 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:48:13,310 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:48:13,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 10:48:13,315 INFO L432 NwaCegarLoop]: 126 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, 126 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 10:48:13,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:48:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 10:48:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-07 10:48:13,360 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-11-07 10:48:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:13,360 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-07 10:48:13,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-07 10:48:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:48:13,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:13,366 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:13,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:48:13,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1977666007, now seen corresponding path program 1 times [2024-11-07 10:48:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543015868] [2024-11-07 10:48:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:13,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:13,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543015868] [2024-11-07 10:48:13,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543015868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:13,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:13,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151710669] [2024-11-07 10:48:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:13,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:13,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:13,779 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:13,833 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-11-07 10:48:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:13,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:48:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:13,838 INFO L225 Difference]: With dead ends: 178 [2024-11-07 10:48:13,838 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:48:13,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:13,839 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:13,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:48:13,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-07 10:48:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-07 10:48:13,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2024-11-07 10:48:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:13,854 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-07 10:48:13,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:13,855 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-07 10:48:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:48:13,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:13,861 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:13,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:48:13,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:13,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1637242919, now seen corresponding path program 1 times [2024-11-07 10:48:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629876792] [2024-11-07 10:48:13,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:14,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:14,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629876792] [2024-11-07 10:48:14,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629876792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:14,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079068673] [2024-11-07 10:48:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:14,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:14,177 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:14,223 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-11-07 10:48:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:48:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:14,226 INFO L225 Difference]: With dead ends: 182 [2024-11-07 10:48:14,226 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:48:14,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:14,227 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:14,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:48:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-07 10:48:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-07 10:48:14,244 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2024-11-07 10:48:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:14,244 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-07 10:48:14,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-07 10:48:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:48:14,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:14,245 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:14,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:48:14,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:14,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash 137764443, now seen corresponding path program 1 times [2024-11-07 10:48:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691401188] [2024-11-07 10:48:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:14,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:14,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691401188] [2024-11-07 10:48:14,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691401188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:14,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:14,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:14,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940441049] [2024-11-07 10:48:14,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:14,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:14,482 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:14,512 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-07 10:48:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:48:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:14,517 INFO L225 Difference]: With dead ends: 186 [2024-11-07 10:48:14,518 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 10:48:14,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:14,519 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:14,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 10:48:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-07 10:48:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-07 10:48:14,534 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2024-11-07 10:48:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:14,535 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-07 10:48:14,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-07 10:48:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:48:14,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:14,537 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:14,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:48:14,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:14,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash 139611485, now seen corresponding path program 1 times [2024-11-07 10:48:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633285072] [2024-11-07 10:48:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:14,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633285072] [2024-11-07 10:48:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633285072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:48:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870227366] [2024-11-07 10:48:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:19,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:48:19,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:48:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:48:19,254 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:21,168 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2024-11-07 10:48:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:48:21,169 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-07 10:48:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:21,172 INFO L225 Difference]: With dead ends: 300 [2024-11-07 10:48:21,172 INFO L226 Difference]: Without dead ends: 208 [2024-11-07 10:48:21,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:48:21,174 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 392 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:21,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 627 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:48:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-07 10:48:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 110. [2024-11-07 10:48:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-07 10:48:21,191 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 104 [2024-11-07 10:48:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:21,192 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-07 10:48:21,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-07 10:48:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:48:21,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:21,203 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:48:21,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1665826849, now seen corresponding path program 1 times [2024-11-07 10:48:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838870932] [2024-11-07 10:48:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:21,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838870932] [2024-11-07 10:48:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838870932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:21,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:48:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455961788] [2024-11-07 10:48:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:21,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:48:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:48:21,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:48:21,346 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:21,392 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2024-11-07 10:48:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:48:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:48:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:21,394 INFO L225 Difference]: With dead ends: 271 [2024-11-07 10:48:21,395 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 10:48:21,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 10:48:21,396 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:21,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 315 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 10:48:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 124. [2024-11-07 10:48:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 110 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-07 10:48:21,415 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 104 [2024-11-07 10:48:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:21,415 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-07 10:48:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-07 10:48:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:48:21,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:21,419 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:21,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:48:21,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash 58712133, now seen corresponding path program 1 times [2024-11-07 10:48:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776528011] [2024-11-07 10:48:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776528011] [2024-11-07 10:48:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776528011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:23,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294567488] [2024-11-07 10:48:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:23,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:48:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:23,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:48:23,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:48:23,138 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:23,482 INFO L93 Difference]: Finished difference Result 286 states and 402 transitions. [2024-11-07 10:48:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:23,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-07 10:48:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:23,484 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:48:23,484 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 10:48:23,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:23,485 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 59 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:23,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 333 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:48:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 10:48:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 111. [2024-11-07 10:48:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-11-07 10:48:23,493 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 105 [2024-11-07 10:48:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-11-07 10:48:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-11-07 10:48:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:48:23,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:23,494 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:23,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:48:23,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1509351380, now seen corresponding path program 1 times [2024-11-07 10:48:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847042451] [2024-11-07 10:48:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847042451] [2024-11-07 10:48:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847042451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:48:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842554456] [2024-11-07 10:48:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:48:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:48:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:24,606 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:25,062 INFO L93 Difference]: Finished difference Result 295 states and 410 transitions. [2024-11-07 10:48:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-07 10:48:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:25,065 INFO L225 Difference]: With dead ends: 295 [2024-11-07 10:48:25,065 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 10:48:25,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:48:25,066 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 66 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:25,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 544 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:48:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 10:48:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-07 10:48:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 165 states have (on average 1.3515151515151516) internal successors, (223), 166 states have internal predecessors, (223), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:48:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 255 transitions. [2024-11-07 10:48:25,083 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 255 transitions. Word has length 108 [2024-11-07 10:48:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:25,083 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 255 transitions. [2024-11-07 10:48:25,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 255 transitions. [2024-11-07 10:48:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:48:25,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:25,085 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:25,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:48:25,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 384480689, now seen corresponding path program 1 times [2024-11-07 10:48:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577464832] [2024-11-07 10:48:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577464832] [2024-11-07 10:48:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577464832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:25,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:25,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:48:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126001861] [2024-11-07 10:48:25,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:25,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:48:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:48:25,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:48:25,949 INFO L87 Difference]: Start difference. First operand 184 states and 255 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:26,485 INFO L93 Difference]: Finished difference Result 424 states and 589 transitions. [2024-11-07 10:48:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:48:26,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-07 10:48:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:26,489 INFO L225 Difference]: With dead ends: 424 [2024-11-07 10:48:26,490 INFO L226 Difference]: Without dead ends: 243 [2024-11-07 10:48:26,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:48:26,491 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 51 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:26,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 570 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:48:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-07 10:48:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 212. [2024-11-07 10:48:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 194 states have internal predecessors, (265), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:48:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 297 transitions. [2024-11-07 10:48:26,508 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 297 transitions. Word has length 110 [2024-11-07 10:48:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:26,508 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 297 transitions. [2024-11-07 10:48:26,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 297 transitions. [2024-11-07 10:48:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:48:26,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:26,510 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:26,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:48:26,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash 933527345, now seen corresponding path program 1 times [2024-11-07 10:48:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512359659] [2024-11-07 10:48:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512359659] [2024-11-07 10:48:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512359659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:27,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:48:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198792916] [2024-11-07 10:48:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:27,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:48:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:48:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:48:27,392 INFO L87 Difference]: Start difference. First operand 212 states and 297 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:28,054 INFO L93 Difference]: Finished difference Result 425 states and 595 transitions. [2024-11-07 10:48:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:48:28,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-07 10:48:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:28,058 INFO L225 Difference]: With dead ends: 425 [2024-11-07 10:48:28,058 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 10:48:28,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:48:28,059 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 61 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:28,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 647 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:48:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 10:48:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2024-11-07 10:48:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 196 states have internal predecessors, (267), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:48:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 299 transitions. [2024-11-07 10:48:28,081 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 299 transitions. Word has length 110 [2024-11-07 10:48:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:28,082 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 299 transitions. [2024-11-07 10:48:28,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 299 transitions. [2024-11-07 10:48:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:48:28,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:28,084 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:28,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:48:28,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:28,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 565164696, now seen corresponding path program 1 times [2024-11-07 10:48:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652496718] [2024-11-07 10:48:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652496718] [2024-11-07 10:48:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652496718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:28,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:28,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575002312] [2024-11-07 10:48:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:48:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:28,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:48:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:48:28,641 INFO L87 Difference]: Start difference. First operand 214 states and 299 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:28,965 INFO L93 Difference]: Finished difference Result 533 states and 738 transitions. [2024-11-07 10:48:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:48:28,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-07 10:48:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:28,972 INFO L225 Difference]: With dead ends: 533 [2024-11-07 10:48:28,972 INFO L226 Difference]: Without dead ends: 322 [2024-11-07 10:48:28,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:28,973 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 60 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:28,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 375 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:48:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-07 10:48:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2024-11-07 10:48:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 293 states have (on average 1.3549488054607508) internal successors, (397), 296 states have internal predecessors, (397), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:48:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 437 transitions. [2024-11-07 10:48:28,997 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 437 transitions. Word has length 111 [2024-11-07 10:48:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:28,999 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 437 transitions. [2024-11-07 10:48:29,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 437 transitions. [2024-11-07 10:48:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:48:29,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:29,004 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:29,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:48:29,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:29,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2059958937, now seen corresponding path program 1 times [2024-11-07 10:48:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310215352] [2024-11-07 10:48:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:29,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310215352] [2024-11-07 10:48:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310215352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282860805] [2024-11-07 10:48:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:29,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:48:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:29,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:48:29,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:48:29,499 INFO L87 Difference]: Start difference. First operand 318 states and 437 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:29,815 INFO L93 Difference]: Finished difference Result 643 states and 878 transitions. [2024-11-07 10:48:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:48:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-07 10:48:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:29,818 INFO L225 Difference]: With dead ends: 643 [2024-11-07 10:48:29,818 INFO L226 Difference]: Without dead ends: 328 [2024-11-07 10:48:29,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:29,823 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 65 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:29,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 445 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:48:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-07 10:48:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 248. [2024-11-07 10:48:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 227 states have (on average 1.3612334801762114) internal successors, (309), 228 states have internal predecessors, (309), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:48:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 341 transitions. [2024-11-07 10:48:29,847 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 341 transitions. Word has length 111 [2024-11-07 10:48:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:29,848 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 341 transitions. [2024-11-07 10:48:29,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 341 transitions. [2024-11-07 10:48:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:48:29,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:29,850 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:29,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:48:29,850 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1588941123, now seen corresponding path program 1 times [2024-11-07 10:48:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:29,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532721915] [2024-11-07 10:48:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:29,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532721915] [2024-11-07 10:48:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532721915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:30,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:30,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:48:30,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461615561] [2024-11-07 10:48:30,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:30,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:30,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:30,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:30,492 INFO L87 Difference]: Start difference. First operand 248 states and 341 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:30,795 INFO L93 Difference]: Finished difference Result 633 states and 850 transitions. [2024-11-07 10:48:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:48:30,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-11-07 10:48:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:30,798 INFO L225 Difference]: With dead ends: 633 [2024-11-07 10:48:30,798 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 10:48:30,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:30,799 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:30,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 372 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:48:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 10:48:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2024-11-07 10:48:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 350 states have (on average 1.302857142857143) internal successors, (456), 353 states have internal predecessors, (456), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:48:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 508 transitions. [2024-11-07 10:48:30,837 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 508 transitions. Word has length 112 [2024-11-07 10:48:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 508 transitions. [2024-11-07 10:48:30,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 508 transitions. [2024-11-07 10:48:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:48:30,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:30,841 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:30,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:48:30,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:30,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1915206794, now seen corresponding path program 1 times [2024-11-07 10:48:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:30,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103703702] [2024-11-07 10:48:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:48:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:31,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103703702] [2024-11-07 10:48:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103703702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:48:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146138644] [2024-11-07 10:48:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:31,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:48:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:31,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:48:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:31,766 INFO L87 Difference]: Start difference. First operand 385 states and 508 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:32,224 INFO L93 Difference]: Finished difference Result 421 states and 548 transitions. [2024-11-07 10:48:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-11-07 10:48:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:32,228 INFO L225 Difference]: With dead ends: 421 [2024-11-07 10:48:32,228 INFO L226 Difference]: Without dead ends: 419 [2024-11-07 10:48:32,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:48:32,228 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:32,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 519 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:48:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-07 10:48:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 318. [2024-11-07 10:48:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 288 states have (on average 1.2986111111111112) internal successors, (374), 290 states have internal predecessors, (374), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:48:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 418 transitions. [2024-11-07 10:48:32,266 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 418 transitions. Word has length 112 [2024-11-07 10:48:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:32,267 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 418 transitions. [2024-11-07 10:48:32,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 418 transitions. [2024-11-07 10:48:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:48:32,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:32,269 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:32,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:48:32,270 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:32,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1913359752, now seen corresponding path program 1 times [2024-11-07 10:48:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476896722] [2024-11-07 10:48:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:48:32,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429754687] [2024-11-07 10:48:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:32,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:48:32,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:48:32,401 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 10:48:32,403 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 10:48:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:48:33,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:48:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:48:33,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:48:33,640 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:48:33,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:48:33,666 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 10:48:33,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 10:48:33,851 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:33,931 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:48:33,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:48:33 BoogieIcfgContainer [2024-11-07 10:48:33,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:48:33,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:48:33,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:48:33,936 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:48:33,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:12" (3/4) ... [2024-11-07 10:48:33,938 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:48:33,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:48:33,940 INFO L158 Benchmark]: Toolchain (without parser) took 22341.90ms. Allocated memory was 100.7MB in the beginning and 587.2MB in the end (delta: 486.5MB). Free memory was 76.4MB in the beginning and 435.1MB in the end (delta: -358.7MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2024-11-07 10:48:33,940 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:48:33,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.47ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 61.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:48:33,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.35ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 57.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:48:33,940 INFO L158 Benchmark]: Boogie Preprocessor took 60.48ms. Allocated memory is still 100.7MB. Free memory was 57.6MB in the beginning and 54.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:48:33,940 INFO L158 Benchmark]: RCFGBuilder took 655.35ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 64.3MB in the end (delta: -9.5MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-07 10:48:33,941 INFO L158 Benchmark]: TraceAbstraction took 21233.28ms. Allocated memory was 100.7MB in the beginning and 587.2MB in the end (delta: 486.5MB). Free memory was 63.8MB in the beginning and 435.2MB in the end (delta: -371.3MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. [2024-11-07 10:48:33,941 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 587.2MB. Free memory was 435.2MB in the beginning and 435.1MB in the end (delta: 80.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:48:33,942 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.44ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.47ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 61.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.35ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 57.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.48ms. Allocated memory is still 100.7MB. Free memory was 57.6MB in the beginning and 54.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 655.35ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 64.3MB in the end (delta: -9.5MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21233.28ms. Allocated memory was 100.7MB in the beginning and 587.2MB in the end (delta: 486.5MB). Free memory was 63.8MB in the beginning and 435.2MB in the end (delta: -371.3MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 587.2MB. Free memory was 435.2MB in the beginning and 435.1MB in the end (delta: 80.9kB). 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 111. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L51] signed short int last_1_WrapperStruct00_var_1_1 = 2; [L52] unsigned short int last_1_WrapperStruct00_var_1_6 = 128; [L53] signed long int last_1_WrapperStruct00_var_1_8 = 50; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L106] EXPR WrapperStruct00.var_1_1 [L106] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_6 [L107] last_1_WrapperStruct00_var_1_6 = WrapperStruct00.var_1_6 [L108] EXPR WrapperStruct00.var_1_8 [L108] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L98] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L99] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L119] RET updateVariables() [L120] CALL step() [L57] COND TRUE ! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1) [L58] EXPR WrapperStruct00.var_1_4 [L58] EXPR WrapperStruct00.var_1_5 [L58] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5) [L60] EXPR WrapperStruct00.var_1_4 [L60] signed long int stepLocal_0 = 1 * WrapperStruct00.var_1_4; [L61] EXPR WrapperStruct00.var_1_1 [L61] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=5] [L61] EXPR WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=5] [L61] COND FALSE !((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > stepLocal_0) [L64] EXPR WrapperStruct00.var_1_7 [L64] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_7 [L66] EXPR WrapperStruct00.var_1_12 [L66] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_12 [L67] EXPR WrapperStruct00.var_1_12 [L67] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_12 [L68] EXPR WrapperStruct00.var_1_7 [L68] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_7 [L69] EXPR WrapperStruct00.var_1_4 [L69] EXPR WrapperStruct00.var_1_10 [L69] signed long int stepLocal_2 = WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10; [L70] EXPR WrapperStruct00.var_1_7 [L70] unsigned short int stepLocal_1 = WrapperStruct00.var_1_7; [L71] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=-65534, stepLocal_2=2] [L71] COND FALSE !(WrapperStruct00.var_1_9) [L74] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=-65534, stepLocal_2=2] [L74] COND FALSE !(WrapperStruct00.var_1_14 > stepLocal_2) [L81] EXPR WrapperStruct00.var_1_6 [L81] EXPR WrapperStruct00.var_1_5 [L81] WrapperStruct00.var_1_8 = (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1 [L111] EXPR WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_4 [L111] EXPR WrapperStruct00.var_1_5 [L111] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7))) [L111] EXPR WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)) [L111] EXPR WrapperStruct00.var_1_6 [L111] EXPR WrapperStruct00.var_1_7 [L111] EXPR ((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))))) [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))) [L111] EXPR WrapperStruct00.var_1_14 [L111] EXPR WrapperStruct00.var_1_4 [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))) [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_6 [L111] EXPR WrapperStruct00.var_1_5 [L111] EXPR (WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12)) [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_14 == ((unsigned short int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111-L112] return ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_14 == ((unsigned short int) WrapperStruct00.var_1_7)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 934 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 931 mSDsluCounter, 5951 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4261 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2995 IncrementalHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 1690 mSDtfsCounter, 2995 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=13, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 419 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 1727 NumberOfCodeBlocks, 1727 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 6474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 3696/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:48:33,995 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_wrapper-s_file-67.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:48:36,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:48:36,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:48:36,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:48:36,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:48:36,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:48:36,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:48:36,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:48:36,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:48:36,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:48:36,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:48:36,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:48:36,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:48:36,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:48:36,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:48:36,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:48:36,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:48:36,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:48:36,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:48:36,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:48:36,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:48:36,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:48:36,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:48:36,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:36,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:48:36,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:48:36,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:48:36,441 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 -> d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 [2024-11-07 10:48:36,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:48:36,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:48:36,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:48:36,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:48:36,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:48:36,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.i [2024-11-07 10:48:38,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:48:38,484 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:48:38,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.i [2024-11-07 10:48:38,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/644731c3f/15490c953e424f54be322ea836733a85/FLAG042238470 [2024-11-07 10:48:38,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/644731c3f/15490c953e424f54be322ea836733a85 [2024-11-07 10:48:38,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:48:38,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:48:38,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:38,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:48:38,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:48:38,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d30d71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38, skipping insertion in model container [2024-11-07 10:48:38,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:48:38,659 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_variablewrapping_wrapper-s_file-67.i[916,929] [2024-11-07 10:48:38,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:38,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:48:38,737 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_variablewrapping_wrapper-s_file-67.i[916,929] [2024-11-07 10:48:38,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:38,816 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:48:38,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38 WrapperNode [2024-11-07 10:48:38,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:38,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:38,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:48:38,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:48:38,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,906 INFO L138 Inliner]: procedures = 40, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 383 [2024-11-07 10:48:38,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:38,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:48:38,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:48:38,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:48:38,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,963 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-07 10:48:38,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:38,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:39,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:39,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:39,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:39,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:39,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:48:39,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:48:39,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:48:39,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:48:39,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (1/1) ... [2024-11-07 10:48:39,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:48:39,086 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 10:48:39,093 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 10:48:39,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:48:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:48:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:48:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:48:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:48:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:48:39,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:48:39,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:48:39,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:48:39,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:48:39,293 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:48:39,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:48:40,226 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-07 10:48:40,226 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:48:40,240 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:48:40,240 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:48:40,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:40 BoogieIcfgContainer [2024-11-07 10:48:40,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:48:40,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:48:40,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:48:40,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:48:40,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:48:38" (1/3) ... [2024-11-07 10:48:40,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe945cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:48:40, skipping insertion in model container [2024-11-07 10:48:40,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:38" (2/3) ... [2024-11-07 10:48:40,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe945cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:48:40, skipping insertion in model container [2024-11-07 10:48:40,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:40" (3/3) ... [2024-11-07 10:48:40,253 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-67.i [2024-11-07 10:48:40,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:48:40,281 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:48:40,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:48:40,347 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;@2470f042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:48:40,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:48:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:48:40,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:40,359 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:40,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:40,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1790845596, now seen corresponding path program 1 times [2024-11-07 10:48:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:40,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037544956] [2024-11-07 10:48:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:40,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:40,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:40,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:40,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 10:48:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:48:40,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-07 10:48:40,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:40,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:40,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037544956] [2024-11-07 10:48:40,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037544956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:40,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:40,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:48:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119496341] [2024-11-07 10:48:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:40,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:48:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:40,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:48:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:48:40,789 INFO L87 Difference]: Start difference. First operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:40,818 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2024-11-07 10:48:40,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:48:40,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-07 10:48:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:40,828 INFO L225 Difference]: With dead ends: 169 [2024-11-07 10:48:40,829 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:48:40,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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 10:48:40,837 INFO L432 NwaCegarLoop]: 119 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, 119 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 10:48:40,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:48:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:48:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-07 10:48:40,881 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2024-11-07 10:48:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:40,882 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-07 10:48:40,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:48:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-07 10:48:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:48:40,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:40,888 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:40,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:48:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:41,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2128335248, now seen corresponding path program 1 times [2024-11-07 10:48:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571488249] [2024-11-07 10:48:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:41,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:41,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:41,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:48:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:41,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:48:41,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:41,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:41,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571488249] [2024-11-07 10:48:41,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571488249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:41,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:41,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:48:41,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338763863] [2024-11-07 10:48:41,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:41,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:48:41,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:41,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:48:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:48:41,481 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:41,543 INFO L93 Difference]: Finished difference Result 170 states and 242 transitions. [2024-11-07 10:48:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:48:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:48:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:41,546 INFO L225 Difference]: With dead ends: 170 [2024-11-07 10:48:41,546 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:48:41,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:48:41,547 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:41,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:48:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-07 10:48:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2024-11-07 10:48:41,562 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 103 [2024-11-07 10:48:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:41,566 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2024-11-07 10:48:41,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2024-11-07 10:48:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:48:41,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:41,568 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:41,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:48:41,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:41,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1486573678, now seen corresponding path program 1 times [2024-11-07 10:48:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290946496] [2024-11-07 10:48:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:41,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:41,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:48:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:42,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:48:42,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:42,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:42,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290946496] [2024-11-07 10:48:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290946496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:42,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:48:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915742351] [2024-11-07 10:48:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:42,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:42,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:42,146 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:42,288 INFO L93 Difference]: Finished difference Result 176 states and 247 transitions. [2024-11-07 10:48:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:48:42,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:48:42,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:42,290 INFO L225 Difference]: With dead ends: 176 [2024-11-07 10:48:42,290 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:48:42,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:42,291 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:42,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:48:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:48:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-07 10:48:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-11-07 10:48:42,302 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2024-11-07 10:48:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:42,303 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-11-07 10:48:42,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-11-07 10:48:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:48:42,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:42,304 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:42,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:48:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:42,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:42,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash 288433684, now seen corresponding path program 1 times [2024-11-07 10:48:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660466984] [2024-11-07 10:48:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:42,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:42,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:42,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:42,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:48:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:42,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:48:42,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:42,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:42,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:42,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660466984] [2024-11-07 10:48:42,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660466984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:42,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:42,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:48:42,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023674154] [2024-11-07 10:48:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:48:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:42,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:48:42,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:42,782 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:42,907 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2024-11-07 10:48:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:48:42,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:48:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:42,913 INFO L225 Difference]: With dead ends: 180 [2024-11-07 10:48:42,914 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:48:42,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:48:42,918 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:42,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:48:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:48:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-07 10:48:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-11-07 10:48:42,939 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2024-11-07 10:48:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:42,939 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-11-07 10:48:42,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-11-07 10:48:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:48:42,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:42,941 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:42,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:48:43,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:43,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash 290280726, now seen corresponding path program 1 times [2024-11-07 10:48:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:43,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976152587] [2024-11-07 10:48:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:43,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:43,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:43,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:48:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:43,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-07 10:48:43,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:43,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:48:43,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-07 10:48:44,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:44,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 53 [2024-11-07 10:48:45,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:45,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 66 [2024-11-07 10:48:45,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:45,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 69 [2024-11-07 10:48:46,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:46,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 69 [2024-11-07 10:48:46,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:46,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 84 [2024-11-07 10:48:47,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:47,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 100 [2024-11-07 10:48:47,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:47,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 168 treesize of output 143 [2024-11-07 10:48:47,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:47,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 192 treesize of output 167 [2024-11-07 10:48:48,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:48,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 253 treesize of output 121 [2024-11-07 10:48:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 104 proven. 96 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-07 10:48:48,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:48:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:49,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976152587] [2024-11-07 10:48:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976152587] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:48:49,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:48:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 32 [2024-11-07 10:48:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457478018] [2024-11-07 10:48:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:49,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:48:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:48:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2024-11-07 10:48:49,117 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:50,571 INFO L93 Difference]: Finished difference Result 237 states and 328 transitions. [2024-11-07 10:48:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:48:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:48:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:50,573 INFO L225 Difference]: With dead ends: 237 [2024-11-07 10:48:50,573 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 10:48:50,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 10:48:50,575 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:50,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 476 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 10:48:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 10:48:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 108. [2024-11-07 10:48:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2024-11-07 10:48:50,584 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 103 [2024-11-07 10:48:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:50,585 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2024-11-07 10:48:50,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2024-11-07 10:48:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:48:50,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:50,586 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:50,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 10:48:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:50,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:50,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 509135444, now seen corresponding path program 1 times [2024-11-07 10:48:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:50,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391733002] [2024-11-07 10:48:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:50,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:50,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:50,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:50,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 10:48:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:51,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:48:51,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:51,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:51,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391733002] [2024-11-07 10:48:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391733002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:51,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:51,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:48:51,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781233459] [2024-11-07 10:48:51,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:51,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:48:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:48:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:48:51,046 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:51,112 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2024-11-07 10:48:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:48:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:48:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:51,114 INFO L225 Difference]: With dead ends: 246 [2024-11-07 10:48:51,114 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 10:48:51,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 10:48:51,115 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 55 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:51,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 292 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:48:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 10:48:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 104. [2024-11-07 10:48:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:48:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2024-11-07 10:48:51,127 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 103 [2024-11-07 10:48:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2024-11-07 10:48:51,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2024-11-07 10:48:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:48:51,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:51,129 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:51,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:48:51,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:51,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1527356088, now seen corresponding path program 1 times [2024-11-07 10:48:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933405819] [2024-11-07 10:48:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:51,333 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:51,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 10:48:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:51,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 10:48:51,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:51,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:48:51,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:51,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:51,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:51,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:48:51,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-07 10:48:51,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:51,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 50 [2024-11-07 10:48:51,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:51,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 80 [2024-11-07 10:48:52,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:52,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 133 treesize of output 55 [2024-11-07 10:48:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 141 proven. 18 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-07 10:48:52,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:48:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:52,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933405819] [2024-11-07 10:48:52,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933405819] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:48:52,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:48:52,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2024-11-07 10:48:52,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550591340] [2024-11-07 10:48:52,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:52,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:52,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:52,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:52,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:48:52,425 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:53,446 INFO L93 Difference]: Finished difference Result 278 states and 386 transitions. [2024-11-07 10:48:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:48:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-07 10:48:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:53,448 INFO L225 Difference]: With dead ends: 278 [2024-11-07 10:48:53,448 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 10:48:53,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:48:53,449 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:53,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 449 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:48:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 10:48:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-11-07 10:48:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 156 states have internal predecessors, (209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:48:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 241 transitions. [2024-11-07 10:48:53,459 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 241 transitions. Word has length 105 [2024-11-07 10:48:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:53,459 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 241 transitions. [2024-11-07 10:48:53,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 241 transitions. [2024-11-07 10:48:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:48:53,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:53,460 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:53,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:48:53,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:53,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 261825261, now seen corresponding path program 1 times [2024-11-07 10:48:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564943552] [2024-11-07 10:48:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:53,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:53,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:53,665 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:53,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 10:48:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:54,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 10:48:54,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:54,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:48:54,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:48:54,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:48:54,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:48:54,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:48:54,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:48:54,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:54,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-11-07 10:48:54,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:54,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 79 [2024-11-07 10:48:54,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:54,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 155 treesize of output 121 [2024-11-07 10:48:55,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:55,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 179 treesize of output 145 [2024-11-07 10:48:55,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:55,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 205 treesize of output 83 [2024-11-07 10:48:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:48:55,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:48:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:56,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564943552] [2024-11-07 10:48:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564943552] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:48:56,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:48:56,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2024-11-07 10:48:56,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922806030] [2024-11-07 10:48:56,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:56,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:48:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:56,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:48:56,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:48:56,315 INFO L87 Difference]: Start difference. First operand 174 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:57,940 INFO L93 Difference]: Finished difference Result 376 states and 518 transitions. [2024-11-07 10:48:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:48:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:48:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:57,943 INFO L225 Difference]: With dead ends: 376 [2024-11-07 10:48:57,943 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 10:48:57,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2024-11-07 10:48:57,944 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 183 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:57,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 372 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 10:48:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 10:48:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 177. [2024-11-07 10:48:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 159 states have internal predecessors, (212), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:48:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 244 transitions. [2024-11-07 10:48:57,963 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 244 transitions. Word has length 107 [2024-11-07 10:48:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:57,963 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 244 transitions. [2024-11-07 10:48:57,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 244 transitions. [2024-11-07 10:48:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:48:57,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:57,965 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:57,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 10:48:58,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:58,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1427118481, now seen corresponding path program 1 times [2024-11-07 10:48:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330056510] [2024-11-07 10:48:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:58,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:58,171 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:58,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 10:48:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:58,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:48:58,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:48:58,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:48:58,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:48:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330056510] [2024-11-07 10:48:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330056510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:58,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:58,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:48:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138732956] [2024-11-07 10:48:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:58,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:48:58,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:48:58,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:48:58,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:48:58,409 INFO L87 Difference]: Start difference. First operand 177 states and 244 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:58,438 INFO L93 Difference]: Finished difference Result 416 states and 570 transitions. [2024-11-07 10:48:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:48:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:48:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:58,440 INFO L225 Difference]: With dead ends: 416 [2024-11-07 10:48:58,440 INFO L226 Difference]: Without dead ends: 242 [2024-11-07 10:48:58,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 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 10:48:58,441 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 58 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:58,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 231 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-07 10:48:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 177. [2024-11-07 10:48:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 159 states have internal predecessors, (210), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:48:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2024-11-07 10:48:58,454 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 107 [2024-11-07 10:48:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:58,456 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2024-11-07 10:48:58,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:48:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2024-11-07 10:48:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:48:58,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:58,458 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:48:58,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 10:48:58,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:58,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:58,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1387733651, now seen corresponding path program 1 times [2024-11-07 10:48:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:48:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105587795] [2024-11-07 10:48:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:48:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:48:58,661 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:48:58,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:48:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:59,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-07 10:48:59,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:59,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:48:59,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-07 10:48:59,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:59,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 43 [2024-11-07 10:48:59,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:48:59,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 43 [2024-11-07 10:49:00,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:00,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 43 [2024-11-07 10:49:00,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:00,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 43 [2024-11-07 10:49:00,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:00,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 58 [2024-11-07 10:49:00,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:00,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 69 [2024-11-07 10:49:01,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:01,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 122 [2024-11-07 10:49:01,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:01,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 156 treesize of output 146 [2024-11-07 10:49:02,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:02,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 171 treesize of output 85 [2024-11-07 10:49:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 56 proven. 96 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 10:49:02,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:49:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:49:03,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:03,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105587795] [2024-11-07 10:49:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105587795] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:49:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:49:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 33 [2024-11-07 10:49:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969539887] [2024-11-07 10:49:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:03,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:49:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:03,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:49:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 10:49:03,345 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:49:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:05,065 INFO L93 Difference]: Finished difference Result 386 states and 526 transitions. [2024-11-07 10:49:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:49:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:49:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:05,067 INFO L225 Difference]: With dead ends: 386 [2024-11-07 10:49:05,067 INFO L226 Difference]: Without dead ends: 212 [2024-11-07 10:49:05,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=243, Invalid=1089, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 10:49:05,069 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 164 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:49:05,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 546 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 10:49:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-07 10:49:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 180. [2024-11-07 10:49:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 162 states have internal predecessors, (213), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:49:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 245 transitions. [2024-11-07 10:49:05,077 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 245 transitions. Word has length 107 [2024-11-07 10:49:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:05,078 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 245 transitions. [2024-11-07 10:49:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:49:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 245 transitions. [2024-11-07 10:49:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:49:05,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:05,079 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:05,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-07 10:49:05,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:49:05,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:05,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1365078867, now seen corresponding path program 1 times [2024-11-07 10:49:05,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:05,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302899087] [2024-11-07 10:49:05,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:05,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:49:05,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:05,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:49:05,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 10:49:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:05,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 10:49:05,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:05,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2024-11-07 10:49:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 128 [2024-11-07 10:49:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:49:06,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:06,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:06,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302899087] [2024-11-07 10:49:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302899087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:06,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:49:06,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201724089] [2024-11-07 10:49:06,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:06,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:49:06,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:06,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:49:06,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:49:06,054 INFO L87 Difference]: Start difference. First operand 180 states and 245 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:49:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:07,482 INFO L93 Difference]: Finished difference Result 486 states and 662 transitions. [2024-11-07 10:49:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:49:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:49:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:07,485 INFO L225 Difference]: With dead ends: 486 [2024-11-07 10:49:07,485 INFO L226 Difference]: Without dead ends: 309 [2024-11-07 10:49:07,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:49:07,486 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 90 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:49:07,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 275 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:49:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-07 10:49:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 217. [2024-11-07 10:49:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 185 states have (on average 1.2972972972972974) internal successors, (240), 186 states have internal predecessors, (240), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:49:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 296 transitions. [2024-11-07 10:49:07,504 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 296 transitions. Word has length 107 [2024-11-07 10:49:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:07,504 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 296 transitions. [2024-11-07 10:49:07,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:49:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 296 transitions. [2024-11-07 10:49:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:49:07,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:07,505 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:07,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-07 10:49:07,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:49:07,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:07,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 472010962, now seen corresponding path program 1 times [2024-11-07 10:49:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276572911] [2024-11-07 10:49:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:07,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:49:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:07,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:49:07,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 10:49:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:08,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 10:49:08,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:49:08,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:49:08,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:49:08,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:49:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:49:08,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-07 10:49:08,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:08,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 50 [2024-11-07 10:49:08,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:08,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 80 [2024-11-07 10:49:09,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:09,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 52 [2024-11-07 10:49:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 141 proven. 18 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-07 10:49:09,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:49:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:49:09,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276572911] [2024-11-07 10:49:09,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276572911] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:49:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:49:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 22 [2024-11-07 10:49:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750069887] [2024-11-07 10:49:09,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:09,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:49:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:09,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:49:09,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:49:09,995 INFO L87 Difference]: Start difference. First operand 217 states and 296 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:49:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:11,017 INFO L93 Difference]: Finished difference Result 233 states and 311 transitions. [2024-11-07 10:49:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:49:11,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-07 10:49:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:11,020 INFO L225 Difference]: With dead ends: 233 [2024-11-07 10:49:11,020 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 10:49:11,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:49:11,021 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 75 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:49:11,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 514 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:49:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 10:49:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 184. [2024-11-07 10:49:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:49:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 247 transitions. [2024-11-07 10:49:11,039 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 247 transitions. Word has length 109 [2024-11-07 10:49:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:11,039 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 247 transitions. [2024-11-07 10:49:11,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:49:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 247 transitions. [2024-11-07 10:49:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:49:11,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:11,041 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:11,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-07 10:49:11,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:49:11,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:11,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash 473858004, now seen corresponding path program 1 times [2024-11-07 10:49:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:11,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012888135] [2024-11-07 10:49:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:11,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:49:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:11,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:49:11,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 10:49:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:11,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 10:49:11,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:11,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:49:12,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 34 [2024-11-07 10:49:12,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:12,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 54 [2024-11-07 10:49:12,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:12,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 105 [2024-11-07 10:49:13,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:13,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 181 treesize of output 138 [2024-11-07 10:49:17,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:17,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 340 treesize of output 124 [2024-11-07 10:49:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:49:17,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:17,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:17,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012888135] [2024-11-07 10:49:17,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012888135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:17,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:17,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:49:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279385729] [2024-11-07 10:49:17,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:17,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:49:17,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:17,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:49:17,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:49:17,803 INFO L87 Difference]: Start difference. First operand 184 states and 247 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:49:23,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]