./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-76.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-76.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', '56e3d6d2fc9b10ad2a825feaf575f22b192437a633af675cd66580ab558cb0aa'] 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-76.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 56e3d6d2fc9b10ad2a825feaf575f22b192437a633af675cd66580ab558cb0aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:56:39,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:56:39,492 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:56:39,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:56:39,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:56:39,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:56:39,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:56:39,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:56:39,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:56:39,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:56:39,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:56:39,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:56:39,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:56:39,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:56:39,517 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:56:39,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:56:39,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:56:39,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:56:39,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:56:39,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:56:39,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:56:39,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:56:39,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:56:39,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:56:39,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:56:39,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:56:39,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:56:39,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:56:39,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:56:39,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:56:39,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:56:39,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:56:39,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:56:39,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:56:39,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:56:39,521 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 -> 56e3d6d2fc9b10ad2a825feaf575f22b192437a633af675cd66580ab558cb0aa [2024-11-07 06:56:39,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:56:39,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:56:39,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:56:39,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:56:39,789 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:56:39,791 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-76.i [2024-11-07 06:56:41,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:56:41,297 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:56:41,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-76.i [2024-11-07 06:56:41,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a94ed52f/61dcd34bbc744a7f9e879dddd6ec80d7/FLAGb190803ff [2024-11-07 06:56:41,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a94ed52f/61dcd34bbc744a7f9e879dddd6ec80d7 [2024-11-07 06:56:41,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:56:41,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:56:41,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:56:41,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:56:41,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:56:41,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:41,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c61582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41, skipping insertion in model container [2024-11-07 06:56:41,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:41,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:56:41,728 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-76.i[919,932] [2024-11-07 06:56:41,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:56:41,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:56:41,809 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-76.i[919,932] [2024-11-07 06:56:41,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:56:41,864 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:56:41,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41 WrapperNode [2024-11-07 06:56:41,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:56:41,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:56:41,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:56:41,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:56:41,872 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:56:41" (1/1) ... [2024-11-07 06:56:41,885 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:56:41" (1/1) ... [2024-11-07 06:56:41,939 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-07 06:56:41,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:56:41,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:56:41,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:56:41,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:56:41,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:41,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:41,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:41,984 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:56:41,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:41,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:42,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:42,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:42,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:42,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:42,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:56:42,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:56:42,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:56:42,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:56:42,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (1/1) ... [2024-11-07 06:56:42,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:56:42,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:42,056 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:56:42,059 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:56:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:56:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:56:42,078 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:56:42,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:56:42,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:56:42,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:56:42,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:56:42,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:56:42,540 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 06:56:42,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:56:42,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:56:42,552 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:56:42,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:42 BoogieIcfgContainer [2024-11-07 06:56:42,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:56:42,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:56:42,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:56:42,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:56:42,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:56:41" (1/3) ... [2024-11-07 06:56:42,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96358a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:56:42, skipping insertion in model container [2024-11-07 06:56:42,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:41" (2/3) ... [2024-11-07 06:56:42,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96358a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:56:42, skipping insertion in model container [2024-11-07 06:56:42,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:42" (3/3) ... [2024-11-07 06:56:42,567 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-76.i [2024-11-07 06:56:42,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:56:42,583 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:56:42,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:56:42,651 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;@240bd2c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:56:42,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:56:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 06:56:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:56:42,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:42,673 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:42,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 658536334, now seen corresponding path program 1 times [2024-11-07 06:56:42,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:42,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986274926] [2024-11-07 06:56:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:42,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:56:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:56:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:56:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986274926] [2024-11-07 06:56:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986274926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:43,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:43,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:56:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186347011] [2024-11-07 06:56:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:43,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:56:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:43,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:56:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:56:43,094 INFO L87 Difference]: Start difference. First operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 06:56:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:43,123 INFO L93 Difference]: Finished difference Result 169 states and 291 transitions. [2024-11-07 06:56:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:56:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-07 06:56:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:43,132 INFO L225 Difference]: With dead ends: 169 [2024-11-07 06:56:43,133 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 06:56:43,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:56:43,141 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:43,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:56:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 06:56:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 06:56:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 06:56:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-11-07 06:56:43,186 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 137 [2024-11-07 06:56:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:43,186 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-11-07 06:56:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 06:56:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-11-07 06:56:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:56:43,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:43,192 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:56:43,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:43,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2142226986, now seen corresponding path program 1 times [2024-11-07 06:56:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159105789] [2024-11-07 06:56:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:56:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:56:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:56:43,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:43,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159105789] [2024-11-07 06:56:43,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159105789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:43,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:56:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349059093] [2024-11-07 06:56:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:56:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:56:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:56:43,685 INFO L87 Difference]: Start difference. First operand 82 states and 126 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:43,836 INFO L93 Difference]: Finished difference Result 240 states and 372 transitions. [2024-11-07 06:56:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:56:43,837 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-07 06:56:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:43,841 INFO L225 Difference]: With dead ends: 240 [2024-11-07 06:56:43,841 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 06:56:43,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:56:43,843 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 75 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:43,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 313 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:56:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 06:56:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-11-07 06:56:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 118 states have internal predecessors, (171), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:56:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2024-11-07 06:56:43,875 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 137 [2024-11-07 06:56:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:43,876 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2024-11-07 06:56:43,876 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2024-11-07 06:56:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:56:43,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:43,878 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:56:43,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:43,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1441162408, now seen corresponding path program 1 times [2024-11-07 06:56:43,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:43,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362241601] [2024-11-07 06:56:43,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:43,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:56:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:56:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:56:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362241601] [2024-11-07 06:56:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362241601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:44,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:44,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:56:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738194060] [2024-11-07 06:56:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:44,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:56:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:56:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:56:44,379 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 06:56:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:44,485 INFO L93 Difference]: Finished difference Result 471 states and 735 transitions. [2024-11-07 06:56:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:56:44,486 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-07 06:56:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:44,492 INFO L225 Difference]: With dead ends: 471 [2024-11-07 06:56:44,492 INFO L226 Difference]: Without dead ends: 315 [2024-11-07 06:56:44,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:56:44,494 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 167 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:44,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 221 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:56:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-07 06:56:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2024-11-07 06:56:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 230 states have (on average 1.4434782608695653) internal successors, (332), 230 states have internal predecessors, (332), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-07 06:56:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 484 transitions. [2024-11-07 06:56:44,557 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 484 transitions. Word has length 137 [2024-11-07 06:56:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:44,557 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 484 transitions. [2024-11-07 06:56:44,557 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 06:56:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 484 transitions. [2024-11-07 06:56:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 06:56:44,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:44,560 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:44,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:56:44,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:44,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash 182635009, now seen corresponding path program 1 times [2024-11-07 06:56:44,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:44,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149527036] [2024-11-07 06:56:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:44,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:56:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:56:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:56:44,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149527036] [2024-11-07 06:56:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149527036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:56:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008235809] [2024-11-07 06:56:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:44,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:56:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:56:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:56:44,934 INFO L87 Difference]: Start difference. First operand 311 states and 484 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:45,322 INFO L93 Difference]: Finished difference Result 1014 states and 1576 transitions. [2024-11-07 06:56:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:56:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 06:56:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:45,328 INFO L225 Difference]: With dead ends: 1014 [2024-11-07 06:56:45,328 INFO L226 Difference]: Without dead ends: 706 [2024-11-07 06:56:45,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:56:45,330 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 209 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:45,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 389 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:56:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-07 06:56:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 698. [2024-11-07 06:56:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 529 states have (on average 1.4536862003780717) internal successors, (769), 533 states have internal predecessors, (769), 158 states have call successors, (158), 10 states have call predecessors, (158), 10 states have return successors, (158), 154 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-07 06:56:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1085 transitions. [2024-11-07 06:56:45,442 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1085 transitions. Word has length 138 [2024-11-07 06:56:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:45,443 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1085 transitions. [2024-11-07 06:56:45,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1085 transitions. [2024-11-07 06:56:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 06:56:45,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:45,450 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:45,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:56:45,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:45,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1811509697, now seen corresponding path program 1 times [2024-11-07 06:56:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:45,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004505236] [2024-11-07 06:56:45,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:45,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:56:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:56:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 06:56:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004505236] [2024-11-07 06:56:45,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004505236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:56:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511855835] [2024-11-07 06:56:45,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:45,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:45,837 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:56:45,838 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:56:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:45,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 06:56:45,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:56:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-07 06:56:46,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:56:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 06:56:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511855835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:56:46,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:56:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2024-11-07 06:56:46,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650586257] [2024-11-07 06:56:46,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:56:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 06:56:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 06:56:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:56:46,714 INFO L87 Difference]: Start difference. First operand 698 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) [2024-11-07 06:56:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:47,401 INFO L93 Difference]: Finished difference Result 1389 states and 2129 transitions. [2024-11-07 06:56:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 06:56:47,402 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) Word has length 138 [2024-11-07 06:56:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:47,407 INFO L225 Difference]: With dead ends: 1389 [2024-11-07 06:56:47,408 INFO L226 Difference]: Without dead ends: 694 [2024-11-07 06:56:47,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2024-11-07 06:56:47,412 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 399 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:47,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 663 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:56:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-07 06:56:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 595. [2024-11-07 06:56:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 446 states have (on average 1.4349775784753362) internal successors, (640), 448 states have internal predecessors, (640), 136 states have call successors, (136), 12 states have call predecessors, (136), 12 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-07 06:56:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 912 transitions. [2024-11-07 06:56:47,496 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 912 transitions. Word has length 138 [2024-11-07 06:56:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:47,496 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 912 transitions. [2024-11-07 06:56:47,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 6 states have call predecessors, (57), 6 states have call successors, (57) [2024-11-07 06:56:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 912 transitions. [2024-11-07 06:56:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 06:56:47,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:47,500 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:47,519 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:56:47,701 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:56:47,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:47,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash 153558158, now seen corresponding path program 1 times [2024-11-07 06:56:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:47,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008791372] [2024-11-07 06:56:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:47,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:56:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:56:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 06:56:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008791372] [2024-11-07 06:56:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008791372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:56:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772035956] [2024-11-07 06:56:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:47,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:47,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:56:47,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:56:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:48,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:56:48,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:56:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-07 06:56:48,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:56:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 06:56:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772035956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:56:48,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:56:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:56:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500990715] [2024-11-07 06:56:48,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:56:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:56:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:56:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:56:48,306 INFO L87 Difference]: Start difference. First operand 595 states and 912 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:56:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:48,492 INFO L93 Difference]: Finished difference Result 1247 states and 1875 transitions. [2024-11-07 06:56:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:56:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 139 [2024-11-07 06:56:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:48,503 INFO L225 Difference]: With dead ends: 1247 [2024-11-07 06:56:48,504 INFO L226 Difference]: Without dead ends: 655 [2024-11-07 06:56:48,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:56:48,507 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 90 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:48,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 263 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:56:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-07 06:56:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 619. [2024-11-07 06:56:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 464 states have (on average 1.4051724137931034) internal successors, (652), 466 states have internal predecessors, (652), 136 states have call successors, (136), 18 states have call predecessors, (136), 18 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-07 06:56:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 924 transitions. [2024-11-07 06:56:48,585 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 924 transitions. Word has length 139 [2024-11-07 06:56:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:48,586 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 924 transitions. [2024-11-07 06:56:48,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:56:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 924 transitions. [2024-11-07 06:56:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 06:56:48,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:48,587 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:48,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:56:48,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:48,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:48,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 19544652, now seen corresponding path program 1 times [2024-11-07 06:56:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820143782] [2024-11-07 06:56:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:56:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878033031] [2024-11-07 06:56:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:48,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:48,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:48,863 INFO L229 MonitoredProcess]: Starting monitored process 4 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:56:48,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 06:56:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:48,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 06:56:49,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:56:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:56:50,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:56:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820143782] [2024-11-07 06:56:50,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:56:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878033031] [2024-11-07 06:56:50,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878033031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:50,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:50,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:56:50,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82097756] [2024-11-07 06:56:50,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:50,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:56:50,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:50,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:56:50,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:56:50,053 INFO L87 Difference]: Start difference. First operand 619 states and 924 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:51,017 INFO L93 Difference]: Finished difference Result 1916 states and 2847 transitions. [2024-11-07 06:56:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 06:56:51,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-07 06:56:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:51,027 INFO L225 Difference]: With dead ends: 1916 [2024-11-07 06:56:51,028 INFO L226 Difference]: Without dead ends: 1300 [2024-11-07 06:56:51,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:56:51,030 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 697 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:51,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1076 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 06:56:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-11-07 06:56:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 932. [2024-11-07 06:56:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 700 states have (on average 1.3971428571428572) internal successors, (978), 703 states have internal predecessors, (978), 204 states have call successors, (204), 27 states have call predecessors, (204), 27 states have return successors, (204), 201 states have call predecessors, (204), 204 states have call successors, (204) [2024-11-07 06:56:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1386 transitions. [2024-11-07 06:56:51,127 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1386 transitions. Word has length 139 [2024-11-07 06:56:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1386 transitions. [2024-11-07 06:56:51,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1386 transitions. [2024-11-07 06:56:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 06:56:51,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:51,129 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:51,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 06:56:51,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:51,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 699603022, now seen corresponding path program 1 times [2024-11-07 06:56:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278487992] [2024-11-07 06:56:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:56:51,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183288483] [2024-11-07 06:56:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:51,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:51,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:51,393 INFO L229 MonitoredProcess]: Starting monitored process 5 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:56:51,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 06:56:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:51,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:56:51,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:56:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:56:51,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:56:51,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278487992] [2024-11-07 06:56:51,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:56:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183288483] [2024-11-07 06:56:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183288483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:51,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:56:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387745131] [2024-11-07 06:56:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:51,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:56:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:56:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:56:51,773 INFO L87 Difference]: Start difference. First operand 932 states and 1386 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:52,174 INFO L93 Difference]: Finished difference Result 3894 states and 5834 transitions. [2024-11-07 06:56:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:56:52,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-07 06:56:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:52,195 INFO L225 Difference]: With dead ends: 3894 [2024-11-07 06:56:52,195 INFO L226 Difference]: Without dead ends: 2965 [2024-11-07 06:56:52,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:56:52,199 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 251 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:52,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1406 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:56:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2024-11-07 06:56:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1476. [2024-11-07 06:56:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1134 states have (on average 1.4171075837742504) internal successors, (1607), 1139 states have internal predecessors, (1607), 302 states have call successors, (302), 39 states have call predecessors, (302), 39 states have return successors, (302), 297 states have call predecessors, (302), 302 states have call successors, (302) [2024-11-07 06:56:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 2211 transitions. [2024-11-07 06:56:52,401 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 2211 transitions. Word has length 139 [2024-11-07 06:56:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:52,403 INFO L471 AbstractCegarLoop]: Abstraction has 1476 states and 2211 transitions. [2024-11-07 06:56:52,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 2211 transitions. [2024-11-07 06:56:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:56:52,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:52,405 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:52,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 06:56:52,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-07 06:56:52,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:52,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1408478203, now seen corresponding path program 1 times [2024-11-07 06:56:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:52,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624867918] [2024-11-07 06:56:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:56:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:56:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:56:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:56:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:56:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:56:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:56:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:56:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:56:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:56:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:56:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:56:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:56:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:56:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:56:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:56:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:56:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:56:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:56:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:56:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:56:52,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:56:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624867918] [2024-11-07 06:56:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624867918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:56:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:56:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:56:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659847641] [2024-11-07 06:56:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:56:52,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:56:52,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:56:52,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:56:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:56:52,726 INFO L87 Difference]: Start difference. First operand 1476 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:56:52,890 INFO L93 Difference]: Finished difference Result 3719 states and 5589 transitions. [2024-11-07 06:56:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:56:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-07 06:56:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:56:52,908 INFO L225 Difference]: With dead ends: 3719 [2024-11-07 06:56:52,908 INFO L226 Difference]: Without dead ends: 2246 [2024-11-07 06:56:52,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:56:52,915 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 49 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:56:52,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 254 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:56:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2024-11-07 06:56:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2028. [2024-11-07 06:56:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1686 states have (on average 1.440688018979834) internal successors, (2429), 1691 states have internal predecessors, (2429), 302 states have call successors, (302), 39 states have call predecessors, (302), 39 states have return successors, (302), 297 states have call predecessors, (302), 302 states have call successors, (302) [2024-11-07 06:56:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 3033 transitions. [2024-11-07 06:56:53,083 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 3033 transitions. Word has length 140 [2024-11-07 06:56:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:56:53,085 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 3033 transitions. [2024-11-07 06:56:53,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:56:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 3033 transitions. [2024-11-07 06:56:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:56:53,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:56:53,087 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:53,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 06:56:53,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:56:53,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:56:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1111481731, now seen corresponding path program 1 times [2024-11-07 06:56:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:56:53,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685206899] [2024-11-07 06:56:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:53,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:56:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:56:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818006639] [2024-11-07 06:56:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:56:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:56:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:53,140 INFO L229 MonitoredProcess]: Starting monitored process 6 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:56:53,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 06:56:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:56:53,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:56:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:56:53,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:56:53,555 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:56:53,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:56:53,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 06:56:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 06:56:53,761 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:56:53,870 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:56:53,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:56:53 BoogieIcfgContainer [2024-11-07 06:56:53,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:56:53,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:56:53,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:56:53,877 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:56:53,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:56:42" (3/4) ... [2024-11-07 06:56:53,880 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:56:53,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:56:53,882 INFO L158 Benchmark]: Toolchain (without parser) took 12306.62ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 91.2MB in the beginning and 111.2MB in the end (delta: -20.0MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2024-11-07 06:56:53,883 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:56:53,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.60ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 75.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:56:53,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.47ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 71.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:56:53,883 INFO L158 Benchmark]: Boogie Preprocessor took 80.77ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 67.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:56:53,884 INFO L158 Benchmark]: RCFGBuilder took 530.55ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 86.2MB in the end (delta: -18.8MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-07 06:56:53,884 INFO L158 Benchmark]: TraceAbstraction took 11318.83ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 85.3MB in the beginning and 111.2MB in the end (delta: -26.0MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2024-11-07 06:56:53,884 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 251.7MB. Free memory was 111.2MB in the beginning and 111.2MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:56:53,886 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.25ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.60ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 75.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.47ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 71.9MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.77ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 67.6MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 530.55ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 86.2MB in the end (delta: -18.8MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11318.83ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 85.3MB in the beginning and 111.2MB in the end (delta: -26.0MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 251.7MB. Free memory was 111.2MB in the beginning and 111.2MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] signed long int var_1_27 = 0; [L42] signed short int var_1_29 = 2; [L43] unsigned char var_1_31 = 1; [L44] signed long int var_1_32 = 32; [L45] signed long int var_1_34 = 0; [L46] unsigned char var_1_37 = 1; [L47] unsigned long int var_1_38 = 16; [L48] unsigned char var_1_39 = 0; [L49] unsigned char var_1_40 = 0; [L50] double last_1_var_1_1 = 256.5; [L51] float last_1_var_1_8 = 5.25; [L52] signed long int last_1_var_1_11 = 4; [L53] unsigned short int last_1_var_1_14 = 10000; [L54] unsigned short int last_1_var_1_17 = 4; [L55] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_17 = var_1_17 [L177] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L143] var_1_3 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L145] var_1_4 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L146] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L147] var_1_5 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L148] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L152] var_1_16 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L155] var_1_19 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L161] var_1_25 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L165] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] var_1_40 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L168] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L188] RET updateVariables() [L189] CALL step() [L59] var_1_21 = var_1_5 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L60] COND FALSE !(var_1_5 < (- var_1_4)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L67] var_1_27 = var_1_16 [L68] var_1_29 = var_1_20 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L69] COND TRUE var_1_18 == var_1_18 [L70] var_1_31 = (! var_1_26) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L72] COND TRUE var_1_20 < ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L73] COND FALSE !(var_1_25 && ((~ 0u) > var_1_14)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L77] COND FALSE !(var_1_14 < var_1_19) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L80] COND FALSE !((- var_1_5) > var_1_7) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L88] var_1_37 = (var_1_2 && var_1_25) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L89] EXPR var_1_19 & var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L89] EXPR (var_1_19 & var_1_18) & var_1_19 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L89] COND TRUE ((((var_1_20) > (var_1_20)) ? (var_1_20) : (var_1_20))) <= ((var_1_19 & var_1_18) & var_1_19) [L90] var_1_38 = ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L92] COND TRUE var_1_18 < var_1_16 [L93] var_1_39 = (! (var_1_26 && var_1_40)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L95] COND FALSE !(\read(var_1_2)) [L104] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_40=1, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L106] COND TRUE ! var_1_2 [L107] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L111] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L116] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=101, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L117] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=101, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L117] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L120] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L127] COND TRUE var_1_4 <= last_1_var_1_1 [L128] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L132] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L133] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L134] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L180-L181] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=101, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=3, var_1_20=0, var_1_21=2, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=101, var_1_29=0, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_3=3, var_1_40=1, var_1_4=0, var_1_5=2, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 10, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1989 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1937 mSDsluCounter, 4711 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3196 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1665 IncrementalHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 1515 mSDtfsCounter, 1665 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1168 GetRequests, 1104 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2028occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 2224 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2079 NumberOfCodeBlocks, 2079 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1785 ConstructedInterpolants, 0 QuantifiedInterpolants, 5986 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1405 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 8802/8892 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:56:53,919 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-76.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 56e3d6d2fc9b10ad2a825feaf575f22b192437a633af675cd66580ab558cb0aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:56:56,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:56:56,202 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:56:56,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:56:56,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:56:56,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:56:56,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:56:56,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:56:56,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:56:56,240 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:56:56,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:56:56,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:56:56,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:56:56,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:56:56,241 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:56:56,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:56:56,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:56:56,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:56:56,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:56:56,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:56:56,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:56:56,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:56:56,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:56:56,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:56:56,243 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:56:56,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:56:56,243 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:56:56,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:56:56,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:56:56,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:56:56,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:56:56,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:56:56,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:56:56,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:56:56,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:56:56,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:56:56,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:56:56,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:56:56,246 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:56:56,246 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:56:56,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:56:56,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:56:56,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:56:56,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:56:56,246 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 -> 56e3d6d2fc9b10ad2a825feaf575f22b192437a633af675cd66580ab558cb0aa [2024-11-07 06:56:56,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:56:56,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:56:56,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:56:56,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:56:56,538 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:56:56,539 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-76.i [2024-11-07 06:56:57,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:56:58,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:56:58,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-76.i [2024-11-07 06:56:58,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cd977993/db32b2baff924e5cab2a6acffa7bf80f/FLAG05a27656f [2024-11-07 06:56:58,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cd977993/db32b2baff924e5cab2a6acffa7bf80f [2024-11-07 06:56:58,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:56:58,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:56:58,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:56:58,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:56:58,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:56:58,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677f29f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58, skipping insertion in model container [2024-11-07 06:56:58,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:56:58,298 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-76.i[919,932] [2024-11-07 06:56:58,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:56:58,382 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:56:58,391 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-76.i[919,932] [2024-11-07 06:56:58,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:56:58,439 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:56:58,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58 WrapperNode [2024-11-07 06:56:58,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:56:58,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:56:58,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:56:58,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:56:58,451 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:56:58" (1/1) ... [2024-11-07 06:56:58,462 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:56:58" (1/1) ... [2024-11-07 06:56:58,504 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-07 06:56:58,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:56:58,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:56:58,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:56:58,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:56:58,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,547 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:56:58,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:56:58,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:56:58,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:56:58,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:56:58,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (1/1) ... [2024-11-07 06:56:58,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:56:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:56:58,636 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:56:58,643 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:56:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:56:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:56:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:56:58,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:56:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:56:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:56:58,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:56:58,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:57:12,446 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:57:12,446 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:57:12,459 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:57:12,460 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:57:12,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:12 BoogieIcfgContainer [2024-11-07 06:57:12,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:57:12,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:57:12,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:57:12,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:57:12,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:56:58" (1/3) ... [2024-11-07 06:57:12,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463a610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:12, skipping insertion in model container [2024-11-07 06:57:12,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:56:58" (2/3) ... [2024-11-07 06:57:12,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3463a610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:12, skipping insertion in model container [2024-11-07 06:57:12,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:12" (3/3) ... [2024-11-07 06:57:12,472 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-76.i [2024-11-07 06:57:12,486 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:57:12,486 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:57:12,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:57:12,557 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;@6edbb832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:57:12,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:57:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 06:57:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 06:57:12,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:12,577 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:12,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1357040777, now seen corresponding path program 1 times [2024-11-07 06:57:12,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:12,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524741584] [2024-11-07 06:57:12,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:12,597 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:57:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:12,610 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:57:12,612 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:57:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:13,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:57:13,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:57:13,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:57:13,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524741584] [2024-11-07 06:57:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524741584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:13,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:13,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:57:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038944899] [2024-11-07 06:57:13,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:13,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:57:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:13,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:57:13,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:57:13,543 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:57:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:13,574 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2024-11-07 06:57:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:57:13,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2024-11-07 06:57:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:13,583 INFO L225 Difference]: With dead ends: 143 [2024-11-07 06:57:13,583 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 06:57:13,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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:57:13,591 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:13,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 06:57:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 06:57:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 06:57:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-11-07 06:57:13,642 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 132 [2024-11-07 06:57:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:13,644 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-11-07 06:57:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:57:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-11-07 06:57:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 06:57:13,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:13,650 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:13,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 06:57:13,851 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:57:13,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash 331902965, now seen corresponding path program 1 times [2024-11-07 06:57:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:13,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538046625] [2024-11-07 06:57:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:13,853 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:57:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:13,856 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:57:13,858 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:57:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:14,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:57:14,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-07 06:57:18,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:20,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538046625] [2024-11-07 06:57:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538046625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [557692745] [2024-11-07 06:57:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:20,138 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:57:20,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:57:20,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:57:20,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 06:57:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:57:21,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:57:24,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:57:24,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [557692745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:24,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:57:24,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 06:57:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787223612] [2024-11-07 06:57:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:24,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:24,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:57:24,537 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:57:28,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:57:33,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:57:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:33,383 INFO L93 Difference]: Finished difference Result 207 states and 324 transitions. [2024-11-07 06:57:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:33,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2024-11-07 06:57:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:33,388 INFO L225 Difference]: With dead ends: 207 [2024-11-07 06:57:33,388 INFO L226 Difference]: Without dead ends: 139 [2024-11-07 06:57:33,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:57:33,390 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:33,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 201 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-07 06:57:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-07 06:57:33,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-11-07 06:57:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 95 states have internal predecessors, (137), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:57:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 213 transitions. [2024-11-07 06:57:33,420 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 213 transitions. Word has length 132 [2024-11-07 06:57:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:33,421 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 213 transitions. [2024-11-07 06:57:33,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:57:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 213 transitions. [2024-11-07 06:57:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 06:57:33,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:33,425 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:33,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:57:33,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-07 06:57:33,826 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 06:57:33,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:33,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash 432061788, now seen corresponding path program 1 times [2024-11-07 06:57:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:33,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279215875] [2024-11-07 06:57:33,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:33,827 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:57:33,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:33,830 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:57:33,832 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:57:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:34,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:57:34,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-07 06:57:38,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:39,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279215875] [2024-11-07 06:57:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279215875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1801054857] [2024-11-07 06:57:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:39,534 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:57:39,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:57:39,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:57:39,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 06:57:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:40,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:57:40,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:57:43,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:57:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1801054857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:43,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:57:43,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 06:57:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553427689] [2024-11-07 06:57:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:43,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:57:43,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:57:43,627 INFO L87 Difference]: Start difference. First operand 136 states and 213 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:57:47,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:57:51,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:57:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:52,008 INFO L93 Difference]: Finished difference Result 402 states and 633 transitions. [2024-11-07 06:57:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:52,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2024-11-07 06:57:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:52,015 INFO L225 Difference]: With dead ends: 402 [2024-11-07 06:57:52,015 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 06:57:52,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:57:52,018 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 38 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:52,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-07 06:57:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 06:57:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2024-11-07 06:57:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 186 states have (on average 1.4408602150537635) internal successors, (268), 186 states have internal predecessors, (268), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-07 06:57:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 420 transitions. [2024-11-07 06:57:52,072 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 420 transitions. Word has length 133 [2024-11-07 06:57:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:52,072 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 420 transitions. [2024-11-07 06:57:52,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:57:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 420 transitions. [2024-11-07 06:57:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 06:57:52,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:52,075 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:52,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-07 06:57:52,294 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:57:52,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:52,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:52,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1112120158, now seen corresponding path program 1 times [2024-11-07 06:57:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:52,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671445313] [2024-11-07 06:57:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:52,477 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:57:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:52,481 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:57:52,482 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:57:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:53,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:57:53,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-07 06:57:57,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:58,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:57:58,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671445313] [2024-11-07 06:57:58,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671445313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:58,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1692055503] [2024-11-07 06:57:58,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:58,121 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:57:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:57:58,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:57:58,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 06:57:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:59,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 06:57:59,685 INFO L278 TraceCheckSpWp]: Computing forward predicates...