./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-78.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_fillercode_fillercodesize_normal_file-78.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', '5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2'] 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_fillercode_fillercodesize_normal_file-78.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 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:37:06,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:37:06,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:37:06,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:37:06,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:37:06,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:37:06,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:37:06,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:37:06,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:37:06,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:37:06,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:37:06,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:37:06,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:37:06,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:37:06,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:37:06,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:37:06,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:37:06,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:37:06,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:37:06,181 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 -> 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 [2024-11-07 04:37:06,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:37:06,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:37:06,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:37:06,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:37:06,507 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:37:06,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-78.i [2024-11-07 04:37:07,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:37:07,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:37:07,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-78.i [2024-11-07 04:37:07,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/753f6d587/c09dec6b41f546c58dd507dc7266eec0/FLAG403b106d1 [2024-11-07 04:37:07,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/753f6d587/c09dec6b41f546c58dd507dc7266eec0 [2024-11-07 04:37:07,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:37:07,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:37:07,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:37:07,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:37:07,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:37:07,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:07" (1/1) ... [2024-11-07 04:37:07,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315f0bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:07, skipping insertion in model container [2024-11-07 04:37:07,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:07" (1/1) ... [2024-11-07 04:37:07,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:37:07,932 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_fillercode_fillercodesize_normal_file-78.i[913,926] [2024-11-07 04:37:07,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:37:07,995 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:37:08,001 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_fillercode_fillercodesize_normal_file-78.i[913,926] [2024-11-07 04:37:08,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:37:08,033 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:37:08,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08 WrapperNode [2024-11-07 04:37:08,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:37:08,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:37:08,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:37:08,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:37:08,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,095 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-07 04:37:08,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:37:08,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:37:08,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:37:08,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:37:08,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,132 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:37:08,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:37:08,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:37:08,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:37:08,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:37:08,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (1/1) ... [2024-11-07 04:37:08,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:37:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:37:08,192 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 04:37:08,198 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 04:37:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:37:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:37:08,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:37:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:37:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:37:08,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:37:08,285 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:37:08,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:37:08,671 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-07 04:37:08,671 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:37:08,680 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:37:08,680 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:37:08,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:08 BoogieIcfgContainer [2024-11-07 04:37:08,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:37:08,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:37:08,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:37:08,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:37:08,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:37:07" (1/3) ... [2024-11-07 04:37:08,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2298e71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:08, skipping insertion in model container [2024-11-07 04:37:08,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:08" (2/3) ... [2024-11-07 04:37:08,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2298e71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:08, skipping insertion in model container [2024-11-07 04:37:08,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:08" (3/3) ... [2024-11-07 04:37:08,688 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-78.i [2024-11-07 04:37:08,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:37:08,698 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:37:08,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:37:08,738 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;@f2c4999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:37:08,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:37:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 04:37:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 04:37:08,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:08,750 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:08,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1081327444, now seen corresponding path program 1 times [2024-11-07 04:37:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105176787] [2024-11-07 04:37:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:08,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105176787] [2024-11-07 04:37:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105176787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:37:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125395097] [2024-11-07 04:37:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:37:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:09,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:37:09,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:37:09,031 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 04:37:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:09,053 INFO L93 Difference]: Finished difference Result 149 states and 246 transitions. [2024-11-07 04:37:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:37:09,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-07 04:37:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:09,059 INFO L225 Difference]: With dead ends: 149 [2024-11-07 04:37:09,059 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 04:37:09,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 04:37:09,064 INFO L432 NwaCegarLoop]: 110 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, 110 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 04:37:09,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:37:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 04:37:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-07 04:37:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 04:37:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-07 04:37:09,122 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 124 [2024-11-07 04:37:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-07 04:37:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 04:37:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-07 04:37:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 04:37:09,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:09,127 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:09,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:37:09,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1852945056, now seen corresponding path program 1 times [2024-11-07 04:37:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182988223] [2024-11-07 04:37:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182988223] [2024-11-07 04:37:09,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182988223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:09,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:09,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:37:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809609336] [2024-11-07 04:37:09,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:09,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:37:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:37:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:37:09,439 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:09,471 INFO L93 Difference]: Finished difference Result 145 states and 217 transitions. [2024-11-07 04:37:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:37:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-07 04:37:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:09,477 INFO L225 Difference]: With dead ends: 145 [2024-11-07 04:37:09,477 INFO L226 Difference]: Without dead ends: 74 [2024-11-07 04:37:09,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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 04:37:09,478 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:09,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:37:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-07 04:37:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-07 04:37:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 04:37:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-07 04:37:09,487 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 124 [2024-11-07 04:37:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:09,488 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-07 04:37:09,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-07 04:37:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 04:37:09,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:09,490 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:09,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:37:09,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:09,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash -112637507, now seen corresponding path program 1 times [2024-11-07 04:37:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:09,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751654473] [2024-11-07 04:37:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:09,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751654473] [2024-11-07 04:37:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751654473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:09,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:37:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075562936] [2024-11-07 04:37:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:09,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:37:09,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:37:09,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:37:09,773 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:09,944 INFO L93 Difference]: Finished difference Result 217 states and 322 transitions. [2024-11-07 04:37:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:37:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-07 04:37:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:09,947 INFO L225 Difference]: With dead ends: 217 [2024-11-07 04:37:09,947 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 04:37:09,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:09,951 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 84 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:09,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:37:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 04:37:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2024-11-07 04:37:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:37:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2024-11-07 04:37:09,970 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 125 [2024-11-07 04:37:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:09,971 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2024-11-07 04:37:09,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2024-11-07 04:37:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 04:37:09,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:09,975 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:09,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:37:09,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2070223852, now seen corresponding path program 1 times [2024-11-07 04:37:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:09,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802759469] [2024-11-07 04:37:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802759469] [2024-11-07 04:37:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802759469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:37:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064801899] [2024-11-07 04:37:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:37:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:37:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:37:10,212 INFO L87 Difference]: Start difference. First operand 129 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:10,351 INFO L93 Difference]: Finished difference Result 309 states and 458 transitions. [2024-11-07 04:37:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:37:10,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-07 04:37:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:10,354 INFO L225 Difference]: With dead ends: 309 [2024-11-07 04:37:10,354 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 04:37:10,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:10,355 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:10,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 311 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:37:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 04:37:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2024-11-07 04:37:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 147 states have internal predecessors, (196), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 04:37:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2024-11-07 04:37:10,388 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 126 [2024-11-07 04:37:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:10,389 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2024-11-07 04:37:10,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2024-11-07 04:37:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 04:37:10,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:10,390 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:37:10,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 329054776, now seen corresponding path program 1 times [2024-11-07 04:37:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803279959] [2024-11-07 04:37:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803279959] [2024-11-07 04:37:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803279959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:10,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:10,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 04:37:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102117121] [2024-11-07 04:37:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:10,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:37:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:37:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:37:10,665 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:10,889 INFO L93 Difference]: Finished difference Result 582 states and 855 transitions. [2024-11-07 04:37:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 04:37:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-07 04:37:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:10,892 INFO L225 Difference]: With dead ends: 582 [2024-11-07 04:37:10,892 INFO L226 Difference]: Without dead ends: 431 [2024-11-07 04:37:10,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:37:10,893 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 265 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:10,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 621 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:37:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-07 04:37:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 365. [2024-11-07 04:37:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 269 states have (on average 1.3531598513011152) internal successors, (364), 269 states have internal predecessors, (364), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 04:37:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 544 transitions. [2024-11-07 04:37:10,943 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 544 transitions. Word has length 127 [2024-11-07 04:37:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:10,943 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 544 transitions. [2024-11-07 04:37:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 544 transitions. [2024-11-07 04:37:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 04:37:10,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:10,944 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:10,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:37:10,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash -63972234, now seen corresponding path program 1 times [2024-11-07 04:37:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674143026] [2024-11-07 04:37:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:10,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674143026] [2024-11-07 04:37:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674143026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:11,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:11,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:37:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569386034] [2024-11-07 04:37:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:37:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:37:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:37:11,233 INFO L87 Difference]: Start difference. First operand 365 states and 544 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:11,387 INFO L93 Difference]: Finished difference Result 749 states and 1107 transitions. [2024-11-07 04:37:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:37:11,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-07 04:37:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:11,391 INFO L225 Difference]: With dead ends: 749 [2024-11-07 04:37:11,391 INFO L226 Difference]: Without dead ends: 427 [2024-11-07 04:37:11,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:11,392 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:11,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:37:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-07 04:37:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 373. [2024-11-07 04:37:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 04:37:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 551 transitions. [2024-11-07 04:37:11,420 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 551 transitions. Word has length 127 [2024-11-07 04:37:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:11,420 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 551 transitions. [2024-11-07 04:37:11,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 551 transitions. [2024-11-07 04:37:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 04:37:11,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:11,421 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:11,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:37:11,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:11,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1196855801, now seen corresponding path program 1 times [2024-11-07 04:37:11,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:11,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725523579] [2024-11-07 04:37:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:11,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725523579] [2024-11-07 04:37:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725523579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:37:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590394107] [2024-11-07 04:37:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:37:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:37:11,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:11,697 INFO L87 Difference]: Start difference. First operand 373 states and 551 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:11,867 INFO L93 Difference]: Finished difference Result 948 states and 1396 transitions. [2024-11-07 04:37:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:37:11,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-07 04:37:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:11,871 INFO L225 Difference]: With dead ends: 948 [2024-11-07 04:37:11,871 INFO L226 Difference]: Without dead ends: 614 [2024-11-07 04:37:11,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:37:11,873 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 127 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:11,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 447 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:37:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-07 04:37:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 526. [2024-11-07 04:37:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 392 states have (on average 1.336734693877551) internal successors, (524), 392 states have internal predecessors, (524), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 04:37:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 776 transitions. [2024-11-07 04:37:11,928 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 776 transitions. Word has length 128 [2024-11-07 04:37:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:11,928 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 776 transitions. [2024-11-07 04:37:11,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 776 transitions. [2024-11-07 04:37:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 04:37:11,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:11,940 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:37:11,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -978001083, now seen corresponding path program 1 times [2024-11-07 04:37:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75326036] [2024-11-07 04:37:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:12,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:12,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75326036] [2024-11-07 04:37:12,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75326036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:12,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 04:37:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696870858] [2024-11-07 04:37:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:12,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 04:37:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:12,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 04:37:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:37:12,116 INFO L87 Difference]: Start difference. First operand 526 states and 776 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:12,294 INFO L93 Difference]: Finished difference Result 1104 states and 1638 transitions. [2024-11-07 04:37:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:37:12,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-07 04:37:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:12,298 INFO L225 Difference]: With dead ends: 1104 [2024-11-07 04:37:12,298 INFO L226 Difference]: Without dead ends: 674 [2024-11-07 04:37:12,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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 04:37:12,299 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 40 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:12,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 490 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:37:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-07 04:37:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 604. [2024-11-07 04:37:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.3425531914893618) internal successors, (631), 470 states have internal predecessors, (631), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 04:37:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 883 transitions. [2024-11-07 04:37:12,342 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 883 transitions. Word has length 128 [2024-11-07 04:37:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:12,342 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 883 transitions. [2024-11-07 04:37:12,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 883 transitions. [2024-11-07 04:37:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 04:37:12,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:12,343 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:12,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 04:37:12,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:12,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1008502880, now seen corresponding path program 1 times [2024-11-07 04:37:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587561621] [2024-11-07 04:37:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:37:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999589754] [2024-11-07 04:37:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:12,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:37:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:37:12,384 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 04:37:12,386 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 04:37:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:12,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 04:37:12,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 04:37:13,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:37:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587561621] [2024-11-07 04:37:13,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 04:37:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999589754] [2024-11-07 04:37:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999589754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:37:13,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:37:13,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-07 04:37:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043104498] [2024-11-07 04:37:13,743 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 04:37:13,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 04:37:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 04:37:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:37:13,744 INFO L87 Difference]: Start difference. First operand 604 states and 883 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 04:37:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:14,201 INFO L93 Difference]: Finished difference Result 1461 states and 2091 transitions. [2024-11-07 04:37:14,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 04:37:14,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2024-11-07 04:37:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:14,206 INFO L225 Difference]: With dead ends: 1461 [2024-11-07 04:37:14,206 INFO L226 Difference]: Without dead ends: 1078 [2024-11-07 04:37:14,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-07 04:37:14,208 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 153 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:14,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 429 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:37:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-07 04:37:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1034. [2024-11-07 04:37:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 804 states have (on average 1.3258706467661692) internal successors, (1066), 808 states have internal predecessors, (1066), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-07 04:37:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1478 transitions. [2024-11-07 04:37:14,270 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1478 transitions. Word has length 133 [2024-11-07 04:37:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:14,270 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1478 transitions. [2024-11-07 04:37:14,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 04:37:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1478 transitions. [2024-11-07 04:37:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 04:37:14,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:14,272 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:14,282 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 04:37:14,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:37:14,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:14,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:14,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1470718108, now seen corresponding path program 1 times [2024-11-07 04:37:14,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:14,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996666696] [2024-11-07 04:37:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:37:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:37:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:37:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:37:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:37:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:37:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:37:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:37:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:37:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 04:37:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 04:37:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 04:37:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:37:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 04:37:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 04:37:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 04:37:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 04:37:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 04:37:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:37:14,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996666696] [2024-11-07 04:37:14,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996666696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:37:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281396563] [2024-11-07 04:37:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:14,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:37:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:37:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:37:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:14,647 INFO L87 Difference]: Start difference. First operand 1034 states and 1478 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:14,740 INFO L93 Difference]: Finished difference Result 1790 states and 2584 transitions. [2024-11-07 04:37:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:37:14,741 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2024-11-07 04:37:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:14,748 INFO L225 Difference]: With dead ends: 1790 [2024-11-07 04:37:14,748 INFO L226 Difference]: Without dead ends: 1375 [2024-11-07 04:37:14,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:37:14,750 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:14,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 431 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:37:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-07 04:37:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1037. [2024-11-07 04:37:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 807 states have (on average 1.3246592317224288) internal successors, (1069), 811 states have internal predecessors, (1069), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-07 04:37:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1481 transitions. [2024-11-07 04:37:14,816 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1481 transitions. Word has length 133 [2024-11-07 04:37:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1481 transitions. [2024-11-07 04:37:14,817 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1481 transitions. [2024-11-07 04:37:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 04:37:14,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:14,818 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:14,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 04:37:14,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:14,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash 190854430, now seen corresponding path program 1 times [2024-11-07 04:37:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:37:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075140518] [2024-11-07 04:37:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:37:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:37:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603148634] [2024-11-07 04:37:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:14,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:37:14,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:37:14,890 INFO L229 MonitoredProcess]: Starting monitored process 3 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 04:37:14,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 04:37:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:37:15,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:37:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:37:15,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:37:15,254 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:37:15,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:37:15,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 04:37:15,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:37:15,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:37:15,539 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:37:15,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:37:15 BoogieIcfgContainer [2024-11-07 04:37:15,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:37:15,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:37:15,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:37:15,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:37:15,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:08" (3/4) ... [2024-11-07 04:37:15,545 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:37:15,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:37:15,546 INFO L158 Benchmark]: Toolchain (without parser) took 7721.96ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 91.6MB in the beginning and 152.3MB in the end (delta: -60.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-07 04:37:15,546 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:37:15,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.14ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:37:15,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.59ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 69.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:37:15,547 INFO L158 Benchmark]: Boogie Preprocessor took 66.41ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 58.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:37:15,547 INFO L158 Benchmark]: RCFGBuilder took 516.74ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 73.1MB in the end (delta: -14.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-07 04:37:15,547 INFO L158 Benchmark]: TraceAbstraction took 6859.13ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 72.1MB in the beginning and 152.4MB in the end (delta: -80.2MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-11-07 04:37:15,547 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 243.3MB. Free memory was 152.4MB in the beginning and 152.3MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:37:15,548 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.32ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.14ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.59ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 69.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.41ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 58.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 516.74ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 73.1MB in the end (delta: -14.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6859.13ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 72.1MB in the beginning and 152.4MB in the end (delta: -80.2MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 243.3MB. Free memory was 152.4MB in the beginning and 152.3MB in the end (delta: 45.0kB). 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 someBinaryDOUBLEComparisonOperation at line 119, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L112] last_1_var_1_3 = var_1_3 [L113] last_1_var_1_6 = var_1_6 [L114] last_1_var_1_15 = var_1_15 [L115] last_1_var_1_20 = var_1_20 [L116] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L87] var_1_9 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L88] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] var_1_10 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] var_1_14 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L100] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] var_1_17 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] var_1_18 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L107] var_1_19 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L127] RET updateVariables() [L128] CALL step() [L49] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L50] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L54] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L55] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L58] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L62] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L72] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 940 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 936 mSDsluCounter, 3720 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2582 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 762 IncrementalHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1138 mSDtfsCounter, 762 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1037occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 695 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1265 ConstructedInterpolants, 0 QuantifiedInterpolants, 3936 SizeOfPredicates, 4 NumberOfNonLiveVariables, 322 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6078/6120 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 04:37:15,568 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_fillercode_fillercodesize_normal_file-78.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 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:37:17,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:37:17,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:37:17,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:37:17,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:37:17,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:37:17,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:37:17,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:37:17,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:37:17,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:37:17,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:37:17,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:37:17,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:37:17,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:37:17,388 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:37:17,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:37:17,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:37:17,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:37:17,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:37:17,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:37:17,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:37:17,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:37:17,391 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:37:17,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:37:17,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:37:17,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:37:17,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:37:17,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:37:17,392 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 -> 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 [2024-11-07 04:37:17,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:37:17,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:37:17,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:37:17,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:37:17,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:37:17,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-78.i [2024-11-07 04:37:18,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:37:18,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:37:18,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-78.i [2024-11-07 04:37:18,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e72e14f3/802961f141c74c0587995103b903d0c7/FLAGfb3d7a94e [2024-11-07 04:37:18,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e72e14f3/802961f141c74c0587995103b903d0c7 [2024-11-07 04:37:18,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:37:18,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:37:18,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:37:18,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:37:18,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:37:18,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:18" (1/1) ... [2024-11-07 04:37:18,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6903fe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:18, skipping insertion in model container [2024-11-07 04:37:18,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:18" (1/1) ... [2024-11-07 04:37:19,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:37:19,122 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_fillercode_fillercodesize_normal_file-78.i[913,926] [2024-11-07 04:37:19,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:37:19,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:37:19,208 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_fillercode_fillercodesize_normal_file-78.i[913,926] [2024-11-07 04:37:19,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:37:19,258 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:37:19,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19 WrapperNode [2024-11-07 04:37:19,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:37:19,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:37:19,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:37:19,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:37:19,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,297 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-07 04:37:19,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:37:19,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:37:19,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:37:19,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:37:19,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,326 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:37:19,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:37:19,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:37:19,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:37:19,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:37:19,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (1/1) ... [2024-11-07 04:37:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:37:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:37:19,384 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 04:37:19,389 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 04:37:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:37:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:37:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:37:19,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:37:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:37:19,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:37:19,470 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:37:19,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:37:23,675 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:37:23,675 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:37:23,682 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:37:23,682 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:37:23,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:23 BoogieIcfgContainer [2024-11-07 04:37:23,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:37:23,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:37:23,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:37:23,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:37:23,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:37:18" (1/3) ... [2024-11-07 04:37:23,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d526782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:23, skipping insertion in model container [2024-11-07 04:37:23,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:19" (2/3) ... [2024-11-07 04:37:23,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d526782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:23, skipping insertion in model container [2024-11-07 04:37:23,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:23" (3/3) ... [2024-11-07 04:37:23,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-78.i [2024-11-07 04:37:23,700 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:37:23,700 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:37:23,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:37:23,746 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;@463d9694, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:37:23,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:37:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 04:37:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 04:37:23,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:23,755 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:23,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1002863956, now seen corresponding path program 1 times [2024-11-07 04:37:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371680834] [2024-11-07 04:37:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:23,765 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 04:37:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:23,767 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 04:37:23,774 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 04:37:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:24,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:37:24,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 04:37:24,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:37:24,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:37:24,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371680834] [2024-11-07 04:37:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371680834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:24,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:37:24,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526038731] [2024-11-07 04:37:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:24,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:37:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:37:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:37:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:37:24,177 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 04:37:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:24,190 INFO L93 Difference]: Finished difference Result 109 states and 182 transitions. [2024-11-07 04:37:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:37:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-11-07 04:37:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:24,195 INFO L225 Difference]: With dead ends: 109 [2024-11-07 04:37:24,195 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 04:37:24,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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 04:37:24,198 INFO L432 NwaCegarLoop]: 78 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, 78 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 04:37:24,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:37:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 04:37:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 04:37:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 04:37:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-07 04:37:24,222 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 118 [2024-11-07 04:37:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:24,223 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-07 04:37:24,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 04:37:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-07 04:37:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 04:37:24,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:24,226 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:24,239 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 04:37:24,428 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 04:37:24,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:24,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash -550009760, now seen corresponding path program 1 times [2024-11-07 04:37:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112410866] [2024-11-07 04:37:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:24,430 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 04:37:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:24,432 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 04:37:24,433 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 04:37:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:24,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:37:24,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:26,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:37:26,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:37:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112410866] [2024-11-07 04:37:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112410866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:37:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701157631] [2024-11-07 04:37:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:26,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:37:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:37:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:37:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:37:26,152 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:28,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:32,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:34,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:38,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:38,685 INFO L93 Difference]: Finished difference Result 169 states and 245 transitions. [2024-11-07 04:37:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:37:38,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-07 04:37:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:38,716 INFO L225 Difference]: With dead ends: 169 [2024-11-07 04:37:38,716 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 04:37:38,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:37:38,717 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 60 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:38,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 268 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 12.4s Time] [2024-11-07 04:37:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 04:37:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2024-11-07 04:37:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:37:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-11-07 04:37:38,738 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 118 [2024-11-07 04:37:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:38,739 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-11-07 04:37:38,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-11-07 04:37:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 04:37:38,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:38,740 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:38,755 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 04:37:38,940 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 04:37:38,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:38,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash -291844322, now seen corresponding path program 1 times [2024-11-07 04:37:38,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:38,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519229280] [2024-11-07 04:37:38,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:38,942 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 04:37:38,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:38,944 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 04:37:38,945 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 04:37:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:39,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 04:37:39,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:39,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:37:39,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:37:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519229280] [2024-11-07 04:37:39,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519229280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:39,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:37:39,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:37:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62829286] [2024-11-07 04:37:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:37:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:37:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:37:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:37:39,292 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:42,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 04:37:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:37:42,709 INFO L93 Difference]: Finished difference Result 154 states and 226 transitions. [2024-11-07 04:37:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:37:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-07 04:37:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:37:42,746 INFO L225 Difference]: With dead ends: 154 [2024-11-07 04:37:42,746 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 04:37:42,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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 04:37:42,748 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:37:42,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 04:37:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 04:37:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 04:37:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:37:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-11-07 04:37:42,767 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 118 [2024-11-07 04:37:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:37:42,768 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-11-07 04:37:42,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-11-07 04:37:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 04:37:42,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:37:42,770 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:42,784 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 04:37:42,970 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 04:37:42,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:37:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:37:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash -903940054, now seen corresponding path program 1 times [2024-11-07 04:37:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:37:42,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268474128] [2024-11-07 04:37:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:42,971 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 04:37:42,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:37:42,974 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 04:37:42,976 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 04:37:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:43,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 04:37:43,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-07 04:37:45,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:37:47,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:37:47,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268474128] [2024-11-07 04:37:47,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268474128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:37:47,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1465619018] [2024-11-07 04:37:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:37:47,676 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 04:37:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 04:37:47,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 04:37:47,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 04:37:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:37:48,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:37:48,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:37:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:37:49,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:37:49,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1465619018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:37:49,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:37:49,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 04:37:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000684191] [2024-11-07 04:37:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:37:49,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:37:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:37:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:37:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:37:49,223 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:37:50,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:52,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:56,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:57,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:37:59,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:38:02,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:38:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:38:02,843 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2024-11-07 04:38:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:38:02,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-07 04:38:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:38:02,846 INFO L225 Difference]: With dead ends: 235 [2024-11-07 04:38:02,846 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 04:38:02,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:38:02,847 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:38:02,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 199 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-07 04:38:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 04:38:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2024-11-07 04:38:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 114 states have (on average 1.2105263157894737) internal successors, (138), 116 states have internal predecessors, (138), 58 states have call successors, (58), 5 states have call predecessors, (58), 5 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 04:38:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2024-11-07 04:38:02,867 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 119 [2024-11-07 04:38:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:38:02,867 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2024-11-07 04:38:02,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:38:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2024-11-07 04:38:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 04:38:02,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:38:02,870 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:02,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-07 04:38:03,083 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 04:38:03,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 04:38:03,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:38:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:38:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1296967064, now seen corresponding path program 1 times [2024-11-07 04:38:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:38:03,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383663726] [2024-11-07 04:38:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:38:03,272 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 04:38:03,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:38:03,274 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 04:38:03,274 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 04:38:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:38:03,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-07 04:38:03,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:38:35,137 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 04:38:45,630 WARN L286 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)