./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.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-pr-co_file-9.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', '6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4'] 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-pr-co_file-9.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 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:47:09,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:47:09,491 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:47:09,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:47:09,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:47:09,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:47:09,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:47:09,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:47:09,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:47:09,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:47:09,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:47:09,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:47:09,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:47:09,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:47:09,526 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:47:09,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:47:09,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:47:09,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:47:09,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:47:09,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:47:09,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:47:09,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:47:09,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:47:09,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:47:09,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:47:09,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:47:09,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:47:09,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:47:09,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:47:09,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:47:09,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:47:09,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:47:09,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:47:09,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:47:09,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:47:09,530 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 -> 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 [2024-11-07 06:47:09,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:47:09,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:47:09,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:47:09,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:47:09,764 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:47:09,764 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-pr-co_file-9.i [2024-11-07 06:47:10,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:47:11,105 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:47:11,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2024-11-07 06:47:11,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26195fe3/f08fbd9a1fc64697b6e4669606637d53/FLAG143815f6e [2024-11-07 06:47:11,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26195fe3/f08fbd9a1fc64697b6e4669606637d53 [2024-11-07 06:47:11,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:47:11,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:47:11,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:47:11,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:47:11,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:47:11,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e779576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11, skipping insertion in model container [2024-11-07 06:47:11,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:47:11,266 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-pr-co_file-9.i[918,931] [2024-11-07 06:47:11,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:47:11,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:47:11,334 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-pr-co_file-9.i[918,931] [2024-11-07 06:47:11,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:47:11,370 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:47:11,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11 WrapperNode [2024-11-07 06:47:11,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:47:11,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:47:11,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:47:11,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:47:11,378 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:47:11" (1/1) ... [2024-11-07 06:47:11,389 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:47:11" (1/1) ... [2024-11-07 06:47:11,433 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 268 [2024-11-07 06:47:11,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:47:11,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:47:11,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:47:11,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:47:11,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,474 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:47:11,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:47:11,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:47:11,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:47:11,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:47:11,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (1/1) ... [2024-11-07 06:47:11,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:47:11,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:47:11,517 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:47:11,520 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:47:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:47:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:47:11,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:47:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:47:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:47:11,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:47:11,626 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:47:11,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:47:12,034 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 06:47:12,034 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:47:12,046 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:47:12,046 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:47:12,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:12 BoogieIcfgContainer [2024-11-07 06:47:12,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:47:12,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:47:12,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:47:12,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:47:12,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:47:11" (1/3) ... [2024-11-07 06:47:12,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b512efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:12, skipping insertion in model container [2024-11-07 06:47:12,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:11" (2/3) ... [2024-11-07 06:47:12,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b512efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:12, skipping insertion in model container [2024-11-07 06:47:12,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:12" (3/3) ... [2024-11-07 06:47:12,059 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2024-11-07 06:47:12,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:47:12,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:47:12,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:47:12,132 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;@7b2daa03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:47:12,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:47:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:47:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:47:12,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:12,155 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:12,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:12,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2084034838, now seen corresponding path program 1 times [2024-11-07 06:47:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841516052] [2024-11-07 06:47:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841516052] [2024-11-07 06:47:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841516052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:12,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:12,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:47:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71602101] [2024-11-07 06:47:12,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:12,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:47:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:47:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:47:12,862 INFO L87 Difference]: Start difference. First operand has 118 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:12,893 INFO L93 Difference]: Finished difference Result 229 states and 399 transitions. [2024-11-07 06:47:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:47:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-11-07 06:47:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:12,902 INFO L225 Difference]: With dead ends: 229 [2024-11-07 06:47:12,902 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 06:47:12,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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:47:12,907 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:12,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:47:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 06:47:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-07 06:47:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:47:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 176 transitions. [2024-11-07 06:47:12,954 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 176 transitions. Word has length 214 [2024-11-07 06:47:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:12,956 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 176 transitions. [2024-11-07 06:47:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 176 transitions. [2024-11-07 06:47:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:47:12,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:12,959 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:47:12,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:12,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash 780207851, now seen corresponding path program 1 times [2024-11-07 06:47:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710878980] [2024-11-07 06:47:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710878980] [2024-11-07 06:47:15,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710878980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:15,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:15,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:47:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40709262] [2024-11-07 06:47:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:47:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:47:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:47:15,510 INFO L87 Difference]: Start difference. First operand 114 states and 176 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:15,914 INFO L93 Difference]: Finished difference Result 280 states and 433 transitions. [2024-11-07 06:47:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:47:15,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2024-11-07 06:47:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:15,919 INFO L225 Difference]: With dead ends: 280 [2024-11-07 06:47:15,919 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 06:47:15,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:47:15,920 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 194 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:15,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 587 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:47:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 06:47:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 153. [2024-11-07 06:47:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.4745762711864407) internal successors, (174), 118 states have internal predecessors, (174), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:47:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 240 transitions. [2024-11-07 06:47:15,931 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 240 transitions. Word has length 215 [2024-11-07 06:47:15,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:15,932 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 240 transitions. [2024-11-07 06:47:15,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 240 transitions. [2024-11-07 06:47:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:47:15,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:15,935 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:47:15,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:15,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash 920756461, now seen corresponding path program 1 times [2024-11-07 06:47:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370070215] [2024-11-07 06:47:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:17,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370070215] [2024-11-07 06:47:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370070215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:18,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:18,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:47:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587395490] [2024-11-07 06:47:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:18,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:47:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:47:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:47:18,075 INFO L87 Difference]: Start difference. First operand 153 states and 240 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:19,203 INFO L93 Difference]: Finished difference Result 414 states and 646 transitions. [2024-11-07 06:47:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:47:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2024-11-07 06:47:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:19,206 INFO L225 Difference]: With dead ends: 414 [2024-11-07 06:47:19,208 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 06:47:19,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:47:19,211 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 141 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:19,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 749 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 06:47:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 06:47:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 156. [2024-11-07 06:47:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.4710743801652892) internal successors, (178), 121 states have internal predecessors, (178), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:47:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 244 transitions. [2024-11-07 06:47:19,228 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 244 transitions. Word has length 215 [2024-11-07 06:47:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:19,229 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 244 transitions. [2024-11-07 06:47:19,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 244 transitions. [2024-11-07 06:47:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:47:19,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:19,231 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:19,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:47:19,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:19,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 411283371, now seen corresponding path program 1 times [2024-11-07 06:47:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:19,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127633682] [2024-11-07 06:47:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127633682] [2024-11-07 06:47:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127633682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:22,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:22,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 06:47:22,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589100520] [2024-11-07 06:47:22,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:22,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 06:47:22,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 06:47:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:47:22,142 INFO L87 Difference]: Start difference. First operand 156 states and 244 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-07 06:47:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:29,961 INFO L93 Difference]: Finished difference Result 934 states and 1416 transitions. [2024-11-07 06:47:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 06:47:29,962 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 215 [2024-11-07 06:47:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:29,966 INFO L225 Difference]: With dead ends: 934 [2024-11-07 06:47:29,966 INFO L226 Difference]: Without dead ends: 781 [2024-11-07 06:47:29,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=398, Invalid=1008, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 06:47:29,968 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1113 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:29,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1993 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-07 06:47:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2024-11-07 06:47:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 423. [2024-11-07 06:47:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 354 states have (on average 1.5169491525423728) internal successors, (537), 354 states have internal predecessors, (537), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:47:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 669 transitions. [2024-11-07 06:47:30,016 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 669 transitions. Word has length 215 [2024-11-07 06:47:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:30,017 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 669 transitions. [2024-11-07 06:47:30,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 4 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2024-11-07 06:47:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 669 transitions. [2024-11-07 06:47:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:47:30,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:30,021 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:30,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:47:30,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:30,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1465232938, now seen corresponding path program 1 times [2024-11-07 06:47:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:30,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587810476] [2024-11-07 06:47:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:30,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587810476] [2024-11-07 06:47:30,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587810476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:30,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:30,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:47:30,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962831030] [2024-11-07 06:47:30,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:30,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:47:30,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:47:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:47:30,980 INFO L87 Difference]: Start difference. First operand 423 states and 669 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:31,608 INFO L93 Difference]: Finished difference Result 917 states and 1444 transitions. [2024-11-07 06:47:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:47:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2024-11-07 06:47:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:31,611 INFO L225 Difference]: With dead ends: 917 [2024-11-07 06:47:31,611 INFO L226 Difference]: Without dead ends: 497 [2024-11-07 06:47:31,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:47:31,613 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 141 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:31,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 946 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:47:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-07 06:47:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 328. [2024-11-07 06:47:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 259 states have (on average 1.4671814671814671) internal successors, (380), 259 states have internal predecessors, (380), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:47:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 512 transitions. [2024-11-07 06:47:31,644 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 512 transitions. Word has length 215 [2024-11-07 06:47:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:31,645 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 512 transitions. [2024-11-07 06:47:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 512 transitions. [2024-11-07 06:47:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:47:31,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:31,649 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:47:31,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:31,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:31,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1906984902, now seen corresponding path program 1 times [2024-11-07 06:47:31,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545663218] [2024-11-07 06:47:31,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:31,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:31,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:31,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545663218] [2024-11-07 06:47:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545663218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:31,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:47:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278358383] [2024-11-07 06:47:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:31,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:47:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:47:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:47:31,779 INFO L87 Difference]: Start difference. First operand 328 states and 512 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:31,853 INFO L93 Difference]: Finished difference Result 858 states and 1340 transitions. [2024-11-07 06:47:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:47:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2024-11-07 06:47:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:31,860 INFO L225 Difference]: With dead ends: 858 [2024-11-07 06:47:31,861 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 06:47:31,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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:47:31,862 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 149 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:31,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 298 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:47:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 06:47:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 151. [2024-11-07 06:47:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:47:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 233 transitions. [2024-11-07 06:47:31,877 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 233 transitions. Word has length 217 [2024-11-07 06:47:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:31,881 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 233 transitions. [2024-11-07 06:47:31,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 233 transitions. [2024-11-07 06:47:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:47:31,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:31,884 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:47:31,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:31,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2086217114, now seen corresponding path program 1 times [2024-11-07 06:47:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982942187] [2024-11-07 06:47:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:32,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982942187] [2024-11-07 06:47:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982942187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:47:32,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799236468] [2024-11-07 06:47:32,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:32,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:47:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:47:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:47:32,863 INFO L87 Difference]: Start difference. First operand 151 states and 233 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:33,396 INFO L93 Difference]: Finished difference Result 548 states and 831 transitions. [2024-11-07 06:47:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:47:33,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2024-11-07 06:47:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:33,399 INFO L225 Difference]: With dead ends: 548 [2024-11-07 06:47:33,399 INFO L226 Difference]: Without dead ends: 400 [2024-11-07 06:47:33,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:47:33,401 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 242 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:33,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 760 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:47:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-07 06:47:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 319. [2024-11-07 06:47:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 269 states have (on average 1.4684014869888475) internal successors, (395), 271 states have internal predecessors, (395), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:47:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 487 transitions. [2024-11-07 06:47:33,416 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 487 transitions. Word has length 217 [2024-11-07 06:47:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:33,416 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 487 transitions. [2024-11-07 06:47:33,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 487 transitions. [2024-11-07 06:47:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:47:33,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:33,418 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:33,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:47:33,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:33,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1833891023, now seen corresponding path program 1 times [2024-11-07 06:47:33,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:33,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524858724] [2024-11-07 06:47:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:47:33,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524858724] [2024-11-07 06:47:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524858724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:47:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774021685] [2024-11-07 06:47:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:33,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:47:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:47:33,702 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:47:33,704 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:47:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:33,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:47:33,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:47:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 480 proven. 96 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2024-11-07 06:47:34,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:47:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:47:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774021685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:47:34,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:47:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 06:47:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999208662] [2024-11-07 06:47:34,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:47:34,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:47:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:47:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:47:34,559 INFO L87 Difference]: Start difference. First operand 319 states and 487 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 6 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 5 states have call predecessors, (98), 6 states have call successors, (98) [2024-11-07 06:47:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:34,801 INFO L93 Difference]: Finished difference Result 657 states and 988 transitions. [2024-11-07 06:47:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:47:34,802 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 6 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 5 states have call predecessors, (98), 6 states have call successors, (98) Word has length 217 [2024-11-07 06:47:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:34,805 INFO L225 Difference]: With dead ends: 657 [2024-11-07 06:47:34,806 INFO L226 Difference]: Without dead ends: 341 [2024-11-07 06:47:34,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:47:34,807 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 238 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:34,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 303 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:47:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-07 06:47:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2024-11-07 06:47:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 284 states have (on average 1.4295774647887325) internal successors, (406), 286 states have internal predecessors, (406), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 06:47:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 498 transitions. [2024-11-07 06:47:34,823 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 498 transitions. Word has length 217 [2024-11-07 06:47:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:34,823 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 498 transitions. [2024-11-07 06:47:34,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 6 states have call successors, (97), 3 states have call predecessors, (97), 5 states have return successors, (98), 5 states have call predecessors, (98), 6 states have call successors, (98) [2024-11-07 06:47:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 498 transitions. [2024-11-07 06:47:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:47:34,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:34,826 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,841 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:47:35,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:47:35,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:35,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1967904529, now seen corresponding path program 1 times [2024-11-07 06:47:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:35,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901557674] [2024-11-07 06:47:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:47:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246756764] [2024-11-07 06:47:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:35,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:47:35,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:47:35,129 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:47:35,131 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:47:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:35,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 06:47:35,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:47:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 488 proven. 84 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:47:35,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:47:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 12 proven. 84 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:47:35,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:35,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901557674] [2024-11-07 06:47:35,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:47:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246756764] [2024-11-07 06:47:35,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246756764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:47:35,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:47:35,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-07 06:47:35,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857786054] [2024-11-07 06:47:35,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:47:35,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 06:47:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 06:47:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:47:35,848 INFO L87 Difference]: Start difference. First operand 339 states and 498 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-07 06:47:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:36,812 INFO L93 Difference]: Finished difference Result 830 states and 1179 transitions. [2024-11-07 06:47:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 06:47:36,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) Word has length 217 [2024-11-07 06:47:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:36,816 INFO L225 Difference]: With dead ends: 830 [2024-11-07 06:47:36,817 INFO L226 Difference]: Without dead ends: 494 [2024-11-07 06:47:36,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-07 06:47:36,818 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 417 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:36,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1108 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:47:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-07 06:47:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 339. [2024-11-07 06:47:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 286 states have (on average 1.4335664335664335) internal successors, (410), 287 states have internal predecessors, (410), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 06:47:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 498 transitions. [2024-11-07 06:47:36,845 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 498 transitions. Word has length 217 [2024-11-07 06:47:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:36,845 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 498 transitions. [2024-11-07 06:47:36,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 3 states have call predecessors, (62), 3 states have call successors, (62) [2024-11-07 06:47:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 498 transitions. [2024-11-07 06:47:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:47:36,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:36,847 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:47:37,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:47:37,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:37,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash -162989080, now seen corresponding path program 1 times [2024-11-07 06:47:37,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:37,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548954596] [2024-11-07 06:47:37,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548954596] [2024-11-07 06:47:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548954596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:47:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786170472] [2024-11-07 06:47:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:47:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:47:37,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:47:37,393 INFO L87 Difference]: Start difference. First operand 339 states and 498 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:38,010 INFO L93 Difference]: Finished difference Result 943 states and 1354 transitions. [2024-11-07 06:47:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:47:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2024-11-07 06:47:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:38,013 INFO L225 Difference]: With dead ends: 943 [2024-11-07 06:47:38,017 INFO L226 Difference]: Without dead ends: 607 [2024-11-07 06:47:38,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:47:38,019 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 175 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:38,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1057 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:47:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-07 06:47:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 352. [2024-11-07 06:47:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 299 states have (on average 1.4448160535117056) internal successors, (432), 300 states have internal predecessors, (432), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 06:47:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 520 transitions. [2024-11-07 06:47:38,047 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 520 transitions. Word has length 217 [2024-11-07 06:47:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:38,047 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 520 transitions. [2024-11-07 06:47:38,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 520 transitions. [2024-11-07 06:47:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:47:38,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:38,049 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 06:47:38,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:38,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1129081966, now seen corresponding path program 1 times [2024-11-07 06:47:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941239837] [2024-11-07 06:47:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:47:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:47:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:47:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:47:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:47:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:47:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:47:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:47:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:47:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:47:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:47:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:47:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:47:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:47:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:47:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:47:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:47:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:47:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:47:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:47:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:47:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:47:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:47:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:47:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:47:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:47:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:47:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:47:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:47:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:47:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:47:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:47:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:47:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:47:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:47:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941239837] [2024-11-07 06:47:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941239837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:38,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:38,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:47:38,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447453227] [2024-11-07 06:47:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:38,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:47:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:47:38,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:47:38,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:47:38,347 INFO L87 Difference]: Start difference. First operand 352 states and 520 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:38,727 INFO L93 Difference]: Finished difference Result 911 states and 1333 transitions. [2024-11-07 06:47:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:47:38,728 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), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2024-11-07 06:47:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:38,730 INFO L225 Difference]: With dead ends: 911 [2024-11-07 06:47:38,730 INFO L226 Difference]: Without dead ends: 562 [2024-11-07 06:47:38,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:47:38,732 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 102 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:47:38,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1010 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:47:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-07 06:47:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 401. [2024-11-07 06:47:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 348 states have (on average 1.4741379310344827) internal successors, (513), 349 states have internal predecessors, (513), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 06:47:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 601 transitions. [2024-11-07 06:47:38,753 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 601 transitions. Word has length 218 [2024-11-07 06:47:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:38,753 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 601 transitions. [2024-11-07 06:47:38,753 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), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:47:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 601 transitions. [2024-11-07 06:47:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:47:38,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:38,755 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 06:47:38,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:38,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 700982552, now seen corresponding path program 1 times [2024-11-07 06:47:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:47:38,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263616857] [2024-11-07 06:47:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:47:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:47:38,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124127471] [2024-11-07 06:47:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:38,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:47:38,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:47:38,827 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:47:38,838 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:47:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:47:39,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:47:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:47:39,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:47:39,495 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:47:39,496 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:47:39,507 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:47:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:47:39,701 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:47:39,807 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:47:39,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:47:39 BoogieIcfgContainer [2024-11-07 06:47:39,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:47:39,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:47:39,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:47:39,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:47:39,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:12" (3/4) ... [2024-11-07 06:47:39,813 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:47:39,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:47:39,814 INFO L158 Benchmark]: Toolchain (without parser) took 28677.05ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 91.4MB in the beginning and 240.7MB in the end (delta: -149.3MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-07 06:47:39,814 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:47:39,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.65ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 75.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:47:39,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.40ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 72.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:47:39,815 INFO L158 Benchmark]: Boogie Preprocessor took 53.81ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 68.6MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:47:39,815 INFO L158 Benchmark]: RCFGBuilder took 556.74ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 84.2MB in the end (delta: -15.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-07 06:47:39,815 INFO L158 Benchmark]: TraceAbstraction took 27759.56ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 83.8MB in the beginning and 240.8MB in the end (delta: -157.1MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2024-11-07 06:47:39,815 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 327.2MB. Free memory was 240.8MB in the beginning and 240.7MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:47:39,816 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.21ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.65ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 75.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.40ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 72.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.81ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 68.6MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 556.74ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 84.2MB in the end (delta: -15.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27759.56ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 83.8MB in the beginning and 240.8MB in the end (delta: -157.1MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 327.2MB. Free memory was 240.8MB in the beginning and 240.7MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of shiftLeft at line 197, overapproximation of someUnaryDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_23 = 64; [L40] unsigned char var_1_24 = 64; [L41] unsigned char var_1_25 = 2; [L42] unsigned short int var_1_26 = 32; [L43] unsigned long int var_1_27 = 100; [L44] unsigned short int var_1_28 = 64; [L45] float var_1_30 = -0.2; [L46] float var_1_32 = -0.375; [L47] float var_1_33 = 1.4; [L48] float var_1_34 = 200.4; [L49] float var_1_35 = 1.5; [L50] unsigned char var_1_36 = 0; [L51] unsigned char last_1_var_1_10 = 32; [L52] unsigned short int last_1_var_1_12 = 16; [L53] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L192] last_1_var_1_10 = var_1_10 [L193] last_1_var_1_12 = var_1_12 [L194] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_short() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L143] var_1_5 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L150] var_1_7 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L151] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L152] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L152] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L153] var_1_8 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L154] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L155] var_1_9 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L156] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L157] var_1_11 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L159] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L160] var_1_15 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L161] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L162] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L165] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L167] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L168] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L169] var_1_24 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L171] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L174] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=100, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L176] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L178] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L178] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L179] var_1_30 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L180] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L181] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L181] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L182] var_1_32 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L183] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L184] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L184] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L185] var_1_34 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L186] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L187] var_1_36 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L188] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L189] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L205] RET updateVariables() [L206] CALL step() [L57] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L58] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L60] COND FALSE !(((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L65] var_1_33 = var_1_34 [L66] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L67] COND TRUE var_1_6 <= stepLocal_2 [L68] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L72] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L72] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L79] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L81] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L82] COND TRUE var_1_10 <= var_1_16 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=32, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L83] COND TRUE var_1_10 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27) [L84] var_1_26 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L97] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L98] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L99] COND FALSE !((- var_1_9) <= var_1_8) [L112] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L114] COND FALSE !((var_1_1 / var_1_30) > ((((var_1_1 / var_1_32) < 0 ) ? -(var_1_1 / var_1_32) : (var_1_1 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L119] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L120] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L120] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L121] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L128] COND TRUE var_1_20 || var_1_21 [L129] var_1_19 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L131] COND FALSE !(((256 - var_1_25) <= (var_1_16 + var_1_13)) || var_1_20) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L197] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L197] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L197] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L197] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L197-L198] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=2, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=5, var_1_25=497, var_1_26=256, var_1_27=2, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.6s, OverallIterations: 12, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2918 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2912 mSDsluCounter, 9154 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7022 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5846 IncrementalHoareTripleChecker+Invalid, 6167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 2132 mSDtfsCounter, 5846 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1665 GetRequests, 1543 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=4, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1687 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 3247 NumberOfCodeBlocks, 3247 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3014 ConstructedInterpolants, 0 QuantifiedInterpolants, 12805 SizeOfPredicates, 9 NumberOfNonLiveVariables, 970 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 29112/29568 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:47:39,940 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-pr-co_file-9.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 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:47:41,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:47:42,052 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:47:42,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:47:42,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:47:42,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:47:42,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:47:42,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:47:42,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:47:42,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:47:42,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:47:42,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:47:42,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:47:42,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:47:42,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:47:42,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:47:42,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:47:42,088 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:47:42,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:47:42,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:47:42,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:47:42,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:47:42,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:47:42,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:47:42,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:47:42,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:47:42,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:47:42,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:47:42,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:47:42,091 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 -> 6dd6d776f9e66c8cc025ab32529fca2ff2ccbfe84cc1f436072541a4cb2f09b4 [2024-11-07 06:47:42,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:47:42,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:47:42,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:47:42,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:47:42,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:47:42,388 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-pr-co_file-9.i [2024-11-07 06:47:43,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:47:43,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:47:43,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2024-11-07 06:47:43,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f94871b5b/81039165301a42fb9f461f730dfc9f92/FLAG35e839d81 [2024-11-07 06:47:43,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f94871b5b/81039165301a42fb9f461f730dfc9f92 [2024-11-07 06:47:43,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:47:43,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:47:43,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:47:43,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:47:43,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:47:43,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:43" (1/1) ... [2024-11-07 06:47:43,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6728afc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:43, skipping insertion in model container [2024-11-07 06:47:43,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:47:43" (1/1) ... [2024-11-07 06:47:43,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:47:44,062 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-pr-co_file-9.i[918,931] [2024-11-07 06:47:44,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:47:44,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:47:44,169 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-pr-co_file-9.i[918,931] [2024-11-07 06:47:44,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:47:44,223 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:47:44,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44 WrapperNode [2024-11-07 06:47:44,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:47:44,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:47:44,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:47:44,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:47:44,232 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:47:44" (1/1) ... [2024-11-07 06:47:44,249 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:47:44" (1/1) ... [2024-11-07 06:47:44,285 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-07 06:47:44,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:47:44,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:47:44,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:47:44,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:47:44,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,322 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:47:44,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:47:44,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:47:44,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:47:44,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:47:44,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (1/1) ... [2024-11-07 06:47:44,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:47:44,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:47:44,400 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:47:44,404 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:47:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:47:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:47:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:47:44,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:47:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:47:44,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:47:44,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:47:44,521 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:47:53,977 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:47:53,977 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:47:53,991 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:47:53,991 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:47:53,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:53 BoogieIcfgContainer [2024-11-07 06:47:53,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:47:53,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:47:53,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:47:54,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:47:54,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:47:43" (1/3) ... [2024-11-07 06:47:54,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557e8856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:54, skipping insertion in model container [2024-11-07 06:47:54,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:47:44" (2/3) ... [2024-11-07 06:47:54,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557e8856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:47:54, skipping insertion in model container [2024-11-07 06:47:54,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:47:53" (3/3) ... [2024-11-07 06:47:54,008 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-9.i [2024-11-07 06:47:54,019 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:47:54,020 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:47:54,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:47:54,093 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;@66291dbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:47:54,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:47:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:47:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 06:47:54,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:54,119 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:54,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash -732948023, now seen corresponding path program 1 times [2024-11-07 06:47:54,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:47:54,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208331705] [2024-11-07 06:47:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:54,140 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:47:54,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:47:54,143 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:47:54,146 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:47:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:55,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:47:55,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:47:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-11-07 06:47:55,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:47:55,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:47:55,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208331705] [2024-11-07 06:47:55,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208331705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:47:55,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:47:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:47:55,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638011724] [2024-11-07 06:47:55,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:47:55,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:47:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:47:55,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:47:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:47:55,983 INFO L87 Difference]: Start difference. First operand has 95 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:47:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:47:56,013 INFO L93 Difference]: Finished difference Result 182 states and 329 transitions. [2024-11-07 06:47:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:47:56,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 206 [2024-11-07 06:47:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:47:56,022 INFO L225 Difference]: With dead ends: 182 [2024-11-07 06:47:56,022 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 06:47:56,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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:47:56,027 INFO L432 NwaCegarLoop]: 141 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, 141 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:47:56,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:47:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 06:47:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-07 06:47:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:47:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-07 06:47:56,075 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 206 [2024-11-07 06:47:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:47:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-07 06:47:56,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:47:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-07 06:47:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:47:56,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:47:56,079 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,116 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:47:56,283 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:47:56,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:47:56,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:47:56,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1377814466, now seen corresponding path program 1 times [2024-11-07 06:47:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:47:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971456238] [2024-11-07 06:47:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:47:56,288 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:47:56,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:47:56,291 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:47:56,294 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:47:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:47:57,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:47:57,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:48:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-07 06:48:05,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:48:05,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:48:05,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971456238] [2024-11-07 06:48:05,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971456238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:48:05,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:48:05,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:48:05,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944126298] [2024-11-07 06:48:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:48:05,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:48:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:48:05,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:48:05,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:48:05,847 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:48:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:48:06,563 INFO L93 Difference]: Finished difference Result 262 states and 413 transitions. [2024-11-07 06:48:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:48:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-11-07 06:48:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:48:06,567 INFO L225 Difference]: With dead ends: 262 [2024-11-07 06:48:06,568 INFO L226 Difference]: Without dead ends: 175 [2024-11-07 06:48:06,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:48:06,569 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 34 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:48:06,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 280 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 06:48:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-07 06:48:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2024-11-07 06:48:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 104 states have internal predecessors, (141), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:48:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 273 transitions. [2024-11-07 06:48:06,599 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 273 transitions. Word has length 207 [2024-11-07 06:48:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:48:06,599 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 273 transitions. [2024-11-07 06:48:06,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-07 06:48:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 273 transitions. [2024-11-07 06:48:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:48:06,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:48:06,602 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,644 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:48:06,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:48:06,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:48:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:48:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1917880456, now seen corresponding path program 1 times [2024-11-07 06:48:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:48:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796870522] [2024-11-07 06:48:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:48:06,804 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:48:06,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:48:06,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:48:06,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:48:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:48:08,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 06:48:08,438 INFO L278 TraceCheckSpWp]: Computing forward predicates...