./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.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_fillercodestructure_filler-ps-ci_file-15.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', '15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6'] 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_fillercodestructure_filler-ps-ci_file-15.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 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:49:23,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:49:23,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:49:23,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:49:23,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:49:23,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:49:23,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:49:23,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:49:23,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:49:23,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:49:23,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:49:23,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:49:23,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:49:23,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:49:23,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:49:23,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:49:23,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:49:23,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:49:23,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:49:23,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:49:23,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:49:23,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:49:23,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:49:23,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:49:23,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:49:23,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:49:23,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:49:23,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:49:23,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:49:23,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:49:23,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:49:23,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:49:23,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:49:23,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:49:23,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:49:23,468 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 -> 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 [2024-11-07 06:49:23,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:49:23,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:49:23,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:49:23,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:49:23,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:49:23,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2024-11-07 06:49:25,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:49:25,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:49:25,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2024-11-07 06:49:25,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8df244fd/d36d1e3182fe4fdea1b0df115cb53111/FLAG27a1f32fb [2024-11-07 06:49:25,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f8df244fd/d36d1e3182fe4fdea1b0df115cb53111 [2024-11-07 06:49:25,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:49:25,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:49:25,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:49:25,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:49:25,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:49:25,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b88afc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25, skipping insertion in model container [2024-11-07 06:49:25,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:49:25,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2024-11-07 06:49:25,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:49:25,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:49:25,653 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_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2024-11-07 06:49:25,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:49:25,725 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:49:25,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25 WrapperNode [2024-11-07 06:49:25,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:49:25,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:49:25,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:49:25,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:49:25,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,786 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-07 06:49:25,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:49:25,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:49:25,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:49:25,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:49:25,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,825 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 06:49:25,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:49:25,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:49:25,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:49:25,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:49:25,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (1/1) ... [2024-11-07 06:49:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:49:25,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:49:25,881 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 06:49:25,887 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 06:49:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:49:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:49:25,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:49:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:49:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:49:25,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:49:25,985 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:49:25,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:49:26,323 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:49:26,323 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:49:26,338 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:49:26,340 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:49:26,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:26 BoogieIcfgContainer [2024-11-07 06:49:26,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:49:26,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:49:26,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:49:26,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:49:26,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:25" (1/3) ... [2024-11-07 06:49:26,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9c3720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:26, skipping insertion in model container [2024-11-07 06:49:26,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:25" (2/3) ... [2024-11-07 06:49:26,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9c3720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:26, skipping insertion in model container [2024-11-07 06:49:26,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:26" (3/3) ... [2024-11-07 06:49:26,351 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2024-11-07 06:49:26,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:49:26,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:49:26,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:49:26,437 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;@4266f6fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:49:26,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:49:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:49:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:49:26,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:26,458 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:26,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:26,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1721723768, now seen corresponding path program 1 times [2024-11-07 06:49:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:26,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245671661] [2024-11-07 06:49:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:49:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:49:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:49:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:49:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:49:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:49:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:49:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:49:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:49:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:49:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:49:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:49:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:49:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:49:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:49:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:49:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:49:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:49:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:49:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:49:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:49:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:49:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:49:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:49:26,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245671661] [2024-11-07 06:49:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245671661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:26,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:26,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:49:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616755163] [2024-11-07 06:49:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:26,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:49:26,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:49:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:49:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:49:26,907 INFO L87 Difference]: Start difference. First operand has 85 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:49:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:26,940 INFO L93 Difference]: Finished difference Result 161 states and 277 transitions. [2024-11-07 06:49:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:49:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2024-11-07 06:49:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:26,950 INFO L225 Difference]: With dead ends: 161 [2024-11-07 06:49:26,950 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 06:49:26,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 06:49:26,958 INFO L432 NwaCegarLoop]: 120 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, 120 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 06:49:26,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:49:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 06:49:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 06:49:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:49:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-11-07 06:49:27,025 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 156 [2024-11-07 06:49:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-11-07 06:49:27,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:49:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-07 06:49:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:49:27,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:27,030 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:27,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:49:27,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash 74909890, now seen corresponding path program 1 times [2024-11-07 06:49:27,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:27,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325666186] [2024-11-07 06:49:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:27,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:49:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:49:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:49:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:49:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:49:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:49:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:49:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:49:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:49:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:49:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:49:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:49:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:49:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:49:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:49:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:49:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:49:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:49:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:49:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:49:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:49:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:49:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:49:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:27,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:49:27,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325666186] [2024-11-07 06:49:27,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325666186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:27,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:27,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:49:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701337943] [2024-11-07 06:49:27,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:27,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:49:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:49:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:49:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:49:27,418 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:27,499 INFO L93 Difference]: Finished difference Result 209 states and 315 transitions. [2024-11-07 06:49:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:49:27,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-11-07 06:49:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:27,504 INFO L225 Difference]: With dead ends: 209 [2024-11-07 06:49:27,506 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 06:49:27,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 06:49:27,508 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 66 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:27,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 260 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:49:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 06:49:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-07 06:49:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 91 states have internal predecessors, (120), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 06:49:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2024-11-07 06:49:27,548 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 156 [2024-11-07 06:49:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:27,549 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2024-11-07 06:49:27,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2024-11-07 06:49:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:49:27,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:27,551 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:49:27,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:27,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1744943634, now seen corresponding path program 1 times [2024-11-07 06:49:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:27,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878668393] [2024-11-07 06:49:27,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:49:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:49:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:49:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:49:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:49:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:49:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:49:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:49:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:49:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:49:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:49:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:49:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:49:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:49:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:49:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:49:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:49:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:49:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:49:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:49:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:49:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:49:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:49:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:49:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878668393] [2024-11-07 06:49:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878668393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:28,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:49:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212089951] [2024-11-07 06:49:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:28,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:49:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:49:28,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:49:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:49:28,066 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:28,278 INFO L93 Difference]: Finished difference Result 359 states and 538 transitions. [2024-11-07 06:49:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:49:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2024-11-07 06:49:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:28,286 INFO L225 Difference]: With dead ends: 359 [2024-11-07 06:49:28,286 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 06:49:28,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 06:49:28,288 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:28,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 331 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:49:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 06:49:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2024-11-07 06:49:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 129 states have (on average 1.310077519379845) internal successors, (169), 130 states have internal predecessors, (169), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:49:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 289 transitions. [2024-11-07 06:49:28,344 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 289 transitions. Word has length 157 [2024-11-07 06:49:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:28,344 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 289 transitions. [2024-11-07 06:49:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 289 transitions. [2024-11-07 06:49:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:49:28,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:28,347 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:28,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:49:28,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 626528808, now seen corresponding path program 1 times [2024-11-07 06:49:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187578800] [2024-11-07 06:49:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:49:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:49:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:49:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:49:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:49:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:49:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:49:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:49:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:49:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:49:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:49:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:49:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:49:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:49:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:49:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:49:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:49:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:49:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:49:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:49:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:49:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:49:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:49:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:28,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:49:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187578800] [2024-11-07 06:49:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187578800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:28,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:28,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:49:28,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882976925] [2024-11-07 06:49:28,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:28,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:49:28,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:49:28,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:49:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:49:28,770 INFO L87 Difference]: Start difference. First operand 193 states and 289 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:28,886 INFO L93 Difference]: Finished difference Result 458 states and 686 transitions. [2024-11-07 06:49:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:49:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-11-07 06:49:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:28,893 INFO L225 Difference]: With dead ends: 458 [2024-11-07 06:49:28,893 INFO L226 Difference]: Without dead ends: 319 [2024-11-07 06:49:28,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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 06:49:28,895 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:28,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 233 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:49:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-07 06:49:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2024-11-07 06:49:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 214 states have (on average 1.280373831775701) internal successors, (274), 216 states have internal predecessors, (274), 97 states have call successors, (97), 5 states have call predecessors, (97), 5 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-07 06:49:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 468 transitions. [2024-11-07 06:49:28,967 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 468 transitions. Word has length 158 [2024-11-07 06:49:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:28,967 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 468 transitions. [2024-11-07 06:49:28,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 468 transitions. [2024-11-07 06:49:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:49:28,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:28,969 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:28,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:49:28,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:28,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1062414934, now seen corresponding path program 1 times [2024-11-07 06:49:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395949638] [2024-11-07 06:49:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:49:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:49:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:49:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:49:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:49:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:49:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:49:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:49:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:49:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:49:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:49:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:49:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:49:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:49:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:49:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:49:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:49:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:49:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:49:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:49:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:49:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:49:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:49:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:49:29,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:49:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395949638] [2024-11-07 06:49:29,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395949638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:49:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567318714] [2024-11-07 06:49:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:49:29,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:49:29,363 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 06:49:29,366 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 06:49:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:29,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:49:29,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-07 06:49:29,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:49:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:49:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567318714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:49:29,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:49:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:49:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975228857] [2024-11-07 06:49:29,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:49:29,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:49:29,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:49:29,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:49:29,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:49:29,943 INFO L87 Difference]: Start difference. First operand 317 states and 468 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:49:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:30,211 INFO L93 Difference]: Finished difference Result 479 states and 701 transitions. [2024-11-07 06:49:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:49:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 158 [2024-11-07 06:49:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:30,214 INFO L225 Difference]: With dead ends: 479 [2024-11-07 06:49:30,214 INFO L226 Difference]: Without dead ends: 221 [2024-11-07 06:49:30,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:49:30,219 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:30,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 191 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:49:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-07 06:49:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2024-11-07 06:49:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 139 states have (on average 1.1870503597122302) internal successors, (165), 139 states have internal predecessors, (165), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 06:49:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2024-11-07 06:49:30,259 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 158 [2024-11-07 06:49:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:30,259 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2024-11-07 06:49:30,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:49:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2024-11-07 06:49:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:49:30,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:30,261 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:30,289 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 06:49:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:49:30,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 72603568, now seen corresponding path program 1 times [2024-11-07 06:49:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871174908] [2024-11-07 06:49:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:49:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:49:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:49:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:49:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:49:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:49:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:49:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:49:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:49:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:49:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:49:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:49:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:49:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 06:49:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:49:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 06:49:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:49:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 06:49:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:49:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 06:49:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 06:49:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-07 06:49:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 06:49:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:49:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871174908] [2024-11-07 06:49:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871174908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:30,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:30,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:49:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493670407] [2024-11-07 06:49:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:30,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:49:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:49:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:49:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:49:30,764 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:30,896 INFO L93 Difference]: Finished difference Result 304 states and 422 transitions. [2024-11-07 06:49:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:49:30,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2024-11-07 06:49:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:30,899 INFO L225 Difference]: With dead ends: 304 [2024-11-07 06:49:30,899 INFO L226 Difference]: Without dead ends: 227 [2024-11-07 06:49:30,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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 06:49:30,901 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 120 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:30,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 117 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:49:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-07 06:49:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 148. [2024-11-07 06:49:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 95 states have internal predecessors, (108), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:49:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 200 transitions. [2024-11-07 06:49:30,928 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 200 transitions. Word has length 159 [2024-11-07 06:49:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:30,928 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 200 transitions. [2024-11-07 06:49:30,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 200 transitions. [2024-11-07 06:49:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:49:30,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:30,930 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:30,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:49:30,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 752661938, now seen corresponding path program 1 times [2024-11-07 06:49:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:49:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154351080] [2024-11-07 06:49:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:49:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:49:31,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:49:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:49:31,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:49:31,201 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:49:31,202 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:49:31,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:49:31,207 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:49:31,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:49:31,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:49:31 BoogieIcfgContainer [2024-11-07 06:49:31,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:49:31,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:49:31,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:49:31,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:49:31,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:26" (3/4) ... [2024-11-07 06:49:31,369 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:49:31,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:49:31,371 INFO L158 Benchmark]: Toolchain (without parser) took 6018.98ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 76.7MB in the beginning and 107.9MB in the end (delta: -31.2MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-07 06:49:31,371 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:31,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.02ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 61.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:49:31,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.21ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:31,371 INFO L158 Benchmark]: Boogie Preprocessor took 54.70ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 56.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:31,371 INFO L158 Benchmark]: RCFGBuilder took 494.43ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 73.4MB in the end (delta: -16.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-07 06:49:31,372 INFO L158 Benchmark]: TraceAbstraction took 5022.44ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 72.9MB in the beginning and 107.9MB in the end (delta: -35.0MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-11-07 06:49:31,372 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 159.4MB. Free memory was 107.9MB in the beginning and 107.9MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:49:31,376 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.97ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.02ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 61.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.21ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.70ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 56.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 494.43ms. Allocated memory is still 100.7MB. Free memory was 56.5MB in the beginning and 73.4MB in the end (delta: -16.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5022.44ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 72.9MB in the beginning and 107.9MB in the end (delta: -35.0MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 159.4MB. Free memory was 107.9MB in the beginning and 107.9MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryArithmeticDOUBLEoperation at line 109, overapproximation of someUnaryDOUBLEoperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 196. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed long int var_1_34 = -10; [L44] double var_1_36 = 4.85; [L45] double var_1_38 = 15.75; [L46] signed char var_1_39 = -100; [L47] signed short int var_1_41 = -32; [L48] signed char var_1_42 = 4; [L49] signed char var_1_43 = -8; [L50] signed short int var_1_44 = -25; [L51] signed char last_1_var_1_10 = -5; [L52] signed long int last_1_var_1_21 = 1; [L53] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_21 = var_1_21 [L193] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L151] var_1_3 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L152] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L153] var_1_4 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L154] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L155] var_1_7 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L158] var_1_8 = __VERIFIER_nondet_short() [L159] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=256] [L159] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=256] [L160] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=256] [L160] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=256] [L161] var_1_9 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L162] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L163] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L163] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L164] var_1_11 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L165] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L166] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L166] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L167] var_1_13 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L168] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L169] var_1_14 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L170] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L171] var_1_15 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L172] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L173] var_1_16 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L174] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L175] var_1_20 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L176] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L177] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L177] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L178] var_1_22 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L179] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L180] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L180] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L181] var_1_23 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L182] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L183] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L183] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L184] var_1_38 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L186] var_1_43 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L187] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L188] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L188] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L204] RET updateVariables() [L205] CALL step() [L57] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L58] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L61] COND FALSE !(var_1_11 >= 25) [L72] var_1_26 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L76] var_1_34 = ((((128) < (((((var_1_22) > ((-5 + var_1_10))) ? (var_1_22) : ((-5 + var_1_10)))))) ? (128) : (((((var_1_22) > ((-5 + var_1_10))) ? (var_1_22) : ((-5 + var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L77] COND FALSE !(\read(var_1_20)) [L80] var_1_36 = ((((var_1_16) > (var_1_38)) ? (var_1_16) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L82] var_1_39 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L83] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L86] COND TRUE var_1_23 <= var_1_22 [L87] var_1_42 = ((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L89] COND TRUE (! var_1_20) || var_1_20 [L90] var_1_44 = var_1_23 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L102] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L103] COND TRUE var_1_11 <= last_1_var_1_25 [L104] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L107] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L108] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L109] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L113] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L114] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L121] COND FALSE !(\read(var_1_19)) [L124] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L126] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L127] COND TRUE var_1_19 || stepLocal_0 [L128] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L132] signed long int stepLocal_3 = var_1_22 + var_1_11; [L133] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=2, stepLocal_3=16381, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L134] COND FALSE !(\read(var_1_20)) [L147] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=2, stepLocal_3=16381, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16385, var_1_23=0, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=0, var_1_7=16383, var_1_8=16385, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 1252 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 554 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 698 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 623 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 129 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1261 NumberOfCodeBlocks, 1261 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2376 SizeOfPredicates, 1 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 8033/8096 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 06:49:31,406 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_fillercodestructure_filler-ps-ci_file-15.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 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:49:33,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:49:33,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:49:33,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:49:33,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:49:33,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:49:33,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:49:33,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:49:33,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:49:33,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:49:33,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:49:33,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:49:33,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:49:33,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:49:33,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:49:33,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:49:33,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:49:33,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:49:33,836 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:49:33,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:49:33,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:49:33,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:49:33,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:49:33,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:49:33,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:49:33,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:49:33,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:49:33,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:49:33,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:49:33,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:49:33,839 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:49:33,839 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:49:33,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:49:33,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:49:33,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:49:33,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:49:33,839 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 -> 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 [2024-11-07 06:49:34,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:49:34,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:49:34,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:49:34,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:49:34,120 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:49:34,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2024-11-07 06:49:35,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:49:35,763 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:49:35,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2024-11-07 06:49:35,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ecfbaa4c/c518727ea7a54a6ea510317e0a55b80c/FLAG618506f40 [2024-11-07 06:49:35,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ecfbaa4c/c518727ea7a54a6ea510317e0a55b80c [2024-11-07 06:49:35,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:49:35,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:49:35,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:49:35,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:49:35,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:49:35,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:35" (1/1) ... [2024-11-07 06:49:35,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747f1b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:35, skipping insertion in model container [2024-11-07 06:49:35,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:35" (1/1) ... [2024-11-07 06:49:35,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:49:35,979 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_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2024-11-07 06:49:36,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:49:36,090 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:49:36,103 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_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2024-11-07 06:49:36,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:49:36,181 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:49:36,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36 WrapperNode [2024-11-07 06:49:36,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:49:36,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:49:36,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:49:36,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:49:36,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,224 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-07 06:49:36,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:49:36,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:49:36,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:49:36,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:49:36,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,259 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 06:49:36,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:49:36,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:49:36,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:49:36,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:49:36,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (1/1) ... [2024-11-07 06:49:36,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:49:36,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:49:36,331 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 06:49:36,336 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 06:49:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:49:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:49:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:49:36,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:49:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:49:36,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:49:36,466 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:49:36,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:49:42,368 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:49:42,368 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:49:42,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:49:42,383 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:49:42,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:42 BoogieIcfgContainer [2024-11-07 06:49:42,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:49:42,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:49:42,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:49:42,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:49:42,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:35" (1/3) ... [2024-11-07 06:49:42,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3941aed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:42, skipping insertion in model container [2024-11-07 06:49:42,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:36" (2/3) ... [2024-11-07 06:49:42,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3941aed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:42, skipping insertion in model container [2024-11-07 06:49:42,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:42" (3/3) ... [2024-11-07 06:49:42,394 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2024-11-07 06:49:42,407 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:49:42,408 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:49:42,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:49:42,468 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;@25e67373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:49:42,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:49:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:49:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:49:42,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:42,489 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:42,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:42,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1721723768, now seen corresponding path program 1 times [2024-11-07 06:49:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:42,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422082385] [2024-11-07 06:49:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:42,504 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 06:49:42,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:42,506 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 06:49:42,508 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 06:49:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:43,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:49:43,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-11-07 06:49:43,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:43,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422082385] [2024-11-07 06:49:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422082385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:43,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:43,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:49:43,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687336645] [2024-11-07 06:49:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:49:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:43,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:49:43,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:49:43,224 INFO L87 Difference]: Start difference. First operand has 85 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:49:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:43,266 INFO L93 Difference]: Finished difference Result 161 states and 277 transitions. [2024-11-07 06:49:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:49:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2024-11-07 06:49:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:43,277 INFO L225 Difference]: With dead ends: 161 [2024-11-07 06:49:43,277 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 06:49:43,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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 06:49:43,285 INFO L432 NwaCegarLoop]: 120 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, 120 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 06:49:43,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:49:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 06:49:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 06:49:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:49:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-11-07 06:49:43,338 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 156 [2024-11-07 06:49:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:43,338 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-11-07 06:49:43,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 06:49:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-07 06:49:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:49:43,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:43,344 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:43,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:49:43,548 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 06:49:43,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 74909890, now seen corresponding path program 1 times [2024-11-07 06:49:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011251509] [2024-11-07 06:49:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:43,551 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 06:49:43,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:43,554 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 06:49:43,555 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 06:49:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:44,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:49:44,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-07 06:49:44,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:49:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:49:45,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:45,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011251509] [2024-11-07 06:49:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011251509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:49:45,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:49:45,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:49:45,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538124370] [2024-11-07 06:49:45,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:49:45,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:49:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:49:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:49:45,068 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:49:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:46,863 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2024-11-07 06:49:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:49:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 156 [2024-11-07 06:49:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:46,886 INFO L225 Difference]: With dead ends: 160 [2024-11-07 06:49:46,886 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 06:49:46,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:49:46,888 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:46,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 191 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 06:49:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 06:49:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-07 06:49:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 06:49:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-07 06:49:46,902 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 156 [2024-11-07 06:49:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:46,902 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-07 06:49:46,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:49:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-07 06:49:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:49:46,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:46,905 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:46,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:49:47,105 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 06:49:47,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1677755004, now seen corresponding path program 1 times [2024-11-07 06:49:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:47,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384550434] [2024-11-07 06:49:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:47,107 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 06:49:47,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:47,110 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 06:49:47,111 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 06:49:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:47,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:49:47,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:48,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:48,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384550434] [2024-11-07 06:49:48,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384550434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:48,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:48,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:49:48,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120596010] [2024-11-07 06:49:48,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:48,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:49:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:49:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:49:48,037 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:49,113 INFO L93 Difference]: Finished difference Result 233 states and 331 transitions. [2024-11-07 06:49:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:49:49,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-11-07 06:49:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:49,116 INFO L225 Difference]: With dead ends: 233 [2024-11-07 06:49:49,116 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 06:49:49,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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 06:49:49,121 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:49,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 190 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 06:49:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 06:49:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2024-11-07 06:49:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 103 states have internal predecessors, (125), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:49:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 217 transitions. [2024-11-07 06:49:49,157 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 217 transitions. Word has length 158 [2024-11-07 06:49:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:49,157 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 217 transitions. [2024-11-07 06:49:49,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 217 transitions. [2024-11-07 06:49:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:49:49,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:49,163 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:49,175 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 06:49:49,364 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 06:49:49,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash 769465472, now seen corresponding path program 1 times [2024-11-07 06:49:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088765113] [2024-11-07 06:49:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:49,367 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 06:49:49,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:49,369 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 06:49:49,370 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 06:49:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:49,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:49:49,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:51,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:51,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088765113] [2024-11-07 06:49:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088765113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:51,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:51,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:49:51,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239403384] [2024-11-07 06:49:51,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:51,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:49:51,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:49:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:49:51,408 INFO L87 Difference]: Start difference. First operand 154 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:54,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:49:56,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:49:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:49:56,831 INFO L93 Difference]: Finished difference Result 398 states and 560 transitions. [2024-11-07 06:49:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:49:56,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-11-07 06:49:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:49:56,866 INFO L225 Difference]: With dead ends: 398 [2024-11-07 06:49:56,866 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 06:49:56,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:49:56,871 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:49:56,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-07 06:49:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 06:49:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 214. [2024-11-07 06:49:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 138 states have (on average 1.181159420289855) internal successors, (163), 138 states have internal predecessors, (163), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 06:49:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2024-11-07 06:49:56,951 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 158 [2024-11-07 06:49:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:49:56,951 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2024-11-07 06:49:56,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:49:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2024-11-07 06:49:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:49:56,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:49:56,954 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:49:56,971 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 06:49:57,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:49:57,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:49:57,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:49:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash 72603568, now seen corresponding path program 1 times [2024-11-07 06:49:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:49:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006309097] [2024-11-07 06:49:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:49:57,161 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 06:49:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:49:57,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:49:57,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:49:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:49:57,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 06:49:57,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:49:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 06:49:59,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:49:59,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:49:59,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006309097] [2024-11-07 06:49:59,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006309097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:49:59,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:49:59,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:49:59,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153616899] [2024-11-07 06:49:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:49:59,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:49:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:49:59,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:49:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:49:59,561 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:50:01,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:50:03,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:50:05,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:50:13,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:50:15,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:50:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:15,243 INFO L93 Difference]: Finished difference Result 516 states and 729 transitions. [2024-11-07 06:50:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:50:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2024-11-07 06:50:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:15,261 INFO L225 Difference]: With dead ends: 516 [2024-11-07 06:50:15,263 INFO L226 Difference]: Without dead ends: 365 [2024-11-07 06:50:15,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:50:15,265 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 88 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:15,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 276 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2024-11-07 06:50:15,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-07 06:50:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 218. [2024-11-07 06:50:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 142 states have (on average 1.176056338028169) internal successors, (167), 142 states have internal predecessors, (167), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 06:50:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2024-11-07 06:50:15,325 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 159 [2024-11-07 06:50:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:15,327 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2024-11-07 06:50:15,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 06:50:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2024-11-07 06:50:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:50:15,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:15,330 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:15,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 06:50:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:50:15,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 330769006, now seen corresponding path program 1 times [2024-11-07 06:50:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:15,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438513676] [2024-11-07 06:50:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:15,531 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 06:50:15,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:15,533 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 06:50:15,534 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 06:50:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:15,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:50:15,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 504 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2024-11-07 06:50:17,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:50:18,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:50:18,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438513676] [2024-11-07 06:50:18,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438513676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:18,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:50:18,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-07 06:50:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517241301] [2024-11-07 06:50:18,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:50:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:50:18,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:50:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:50:18,802 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-07 06:50:22,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:50:24,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:50:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:26,165 INFO L93 Difference]: Finished difference Result 560 states and 766 transitions. [2024-11-07 06:50:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 06:50:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 159 [2024-11-07 06:50:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:26,183 INFO L225 Difference]: With dead ends: 560 [2024-11-07 06:50:26,183 INFO L226 Difference]: Without dead ends: 405 [2024-11-07 06:50:26,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2024-11-07 06:50:26,185 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 307 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:26,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 283 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-07 06:50:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-07 06:50:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 226. [2024-11-07 06:50:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 147 states have (on average 1.1564625850340136) internal successors, (170), 147 states have internal predecessors, (170), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 06:50:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 308 transitions. [2024-11-07 06:50:26,220 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 308 transitions. Word has length 159 [2024-11-07 06:50:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:26,220 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 308 transitions. [2024-11-07 06:50:26,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-07 06:50:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 308 transitions. [2024-11-07 06:50:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 06:50:26,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:26,223 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:26,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 06:50:26,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:50:26,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:26,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:26,424 INFO L85 PathProgramCache]: Analyzing trace with hash -993933882, now seen corresponding path program 1 times [2024-11-07 06:50:26,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:26,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852793564] [2024-11-07 06:50:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:26,425 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 06:50:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:26,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:50:26,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 06:50:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:50:26,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-07 06:50:27,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:50:27,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:50:27,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852793564] [2024-11-07 06:50:27,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852793564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:27,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:50:27,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-07 06:50:27,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061616821] [2024-11-07 06:50:27,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:27,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:50:27,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:50:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:50:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:50:27,632 INFO L87 Difference]: Start difference. First operand 226 states and 308 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:50:30,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:50:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:30,136 INFO L93 Difference]: Finished difference Result 320 states and 432 transitions. [2024-11-07 06:50:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:50:30,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 160 [2024-11-07 06:50:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:30,167 INFO L225 Difference]: With dead ends: 320 [2024-11-07 06:50:30,167 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 06:50:30,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:50:30,169 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 101 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:30,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 188 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 06:50:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 06:50:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2024-11-07 06:50:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 95 states have internal predecessors, (106), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:50:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 198 transitions. [2024-11-07 06:50:30,192 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 198 transitions. Word has length 160 [2024-11-07 06:50:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:30,192 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 198 transitions. [2024-11-07 06:50:30,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:50:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2024-11-07 06:50:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 06:50:30,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:30,194 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:30,209 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 (8)] Ended with exit code 0 [2024-11-07 06:50:30,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:50:30,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:30,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash -706902522, now seen corresponding path program 1 times [2024-11-07 06:50:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:30,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833638146] [2024-11-07 06:50:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:30,397 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 06:50:30,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:30,399 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:50:30,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 06:50:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:50:30,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-07 06:50:31,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 06:50:31,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:50:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833638146] [2024-11-07 06:50:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833638146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:31,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:50:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-07 06:50:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562601913] [2024-11-07 06:50:31,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:50:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:50:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:50:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:50:31,595 INFO L87 Difference]: Start difference. First operand 148 states and 198 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:50:34,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:50:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:34,254 INFO L93 Difference]: Finished difference Result 237 states and 314 transitions. [2024-11-07 06:50:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:50:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 160 [2024-11-07 06:50:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:34,279 INFO L225 Difference]: With dead ends: 237 [2024-11-07 06:50:34,279 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 06:50:34,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:50:34,284 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 95 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:34,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 189 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 06:50:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 06:50:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2024-11-07 06:50:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.105263157894737) internal successors, (105), 95 states have internal predecessors, (105), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:50:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. [2024-11-07 06:50:34,314 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 160 [2024-11-07 06:50:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:34,314 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. [2024-11-07 06:50:34,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 06:50:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. [2024-11-07 06:50:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 06:50:34,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:34,317 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:50:34,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 06:50:34,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:50:34,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:34,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1068104840, now seen corresponding path program 1 times [2024-11-07 06:50:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:34,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322572221] [2024-11-07 06:50:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:34,519 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 06:50:34,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:34,521 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:50:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 06:50:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:34,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 06:50:34,859 INFO L278 TraceCheckSpWp]: Computing forward predicates...