./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-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-pe-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', 'c5adc02aa856013d500f38fcfb7b074d7d479a50c6d427eda463f4ffd6df5ef0'] 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-pe-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 c5adc02aa856013d500f38fcfb7b074d7d479a50c6d427eda463f4ffd6df5ef0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:14:25,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:14:25,624 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:14:25,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:14:25,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:14:25,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:14:25,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:14:25,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:14:25,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:14:25,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:14:25,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:14:25,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:14:25,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:14:25,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:14:25,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:14:25,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:14:25,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:14:25,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:14:25,660 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 -> c5adc02aa856013d500f38fcfb7b074d7d479a50c6d427eda463f4ffd6df5ef0 [2024-11-07 06:14:25,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:14:25,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:14:25,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:14:25,893 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:14:25,893 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:14:25,895 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-pe-co_file-9.i [2024-11-07 06:14:27,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:14:27,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:14:27,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-9.i [2024-11-07 06:14:27,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf95fdc7a/7d068d86b2144132a7c11fed52137220/FLAG069d0ba7e [2024-11-07 06:14:27,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf95fdc7a/7d068d86b2144132a7c11fed52137220 [2024-11-07 06:14:27,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:14:27,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:14:27,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:14:27,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:14:27,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:14:27,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:14:27" (1/1) ... [2024-11-07 06:14:27,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71550543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:27, skipping insertion in model container [2024-11-07 06:14:27,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:14:27" (1/1) ... [2024-11-07 06:14:27,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:14:27,969 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-pe-co_file-9.i[918,931] [2024-11-07 06:14:28,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:14:28,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:14:28,069 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-pe-co_file-9.i[918,931] [2024-11-07 06:14:28,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:14:28,105 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:14:28,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28 WrapperNode [2024-11-07 06:14:28,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:14:28,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:14:28,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:14:28,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:14:28,115 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:14:28" (1/1) ... [2024-11-07 06:14:28,129 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:14:28" (1/1) ... [2024-11-07 06:14:28,177 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 268 [2024-11-07 06:14:28,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:14:28,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:14:28,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:14:28,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:14:28,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,217 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:14:28,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:14:28,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:14:28,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:14:28,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:14:28,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (1/1) ... [2024-11-07 06:14:28,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:14:28,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:14:28,285 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:14:28,292 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:14:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:14:28,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:14:28,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:14:28,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:14:28,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:14:28,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:14:28,392 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:14:28,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:14:28,777 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 06:14:28,777 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:14:28,797 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:14:28,799 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:14:28,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:14:28 BoogieIcfgContainer [2024-11-07 06:14:28,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:14:28,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:14:28,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:14:28,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:14:28,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:14:27" (1/3) ... [2024-11-07 06:14:28,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2066e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:14:28, skipping insertion in model container [2024-11-07 06:14:28,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:14:28" (2/3) ... [2024-11-07 06:14:28,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2066e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:14:28, skipping insertion in model container [2024-11-07 06:14:28,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:14:28" (3/3) ... [2024-11-07 06:14:28,810 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-9.i [2024-11-07 06:14:28,824 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:14:28,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:14:28,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:14:28,929 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;@69477e12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:14:28,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:14:28,934 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:14:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:14:28,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:28,948 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:14:28,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:28,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash 256081870, now seen corresponding path program 1 times [2024-11-07 06:14:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825918673] [2024-11-07 06:14:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:29,595 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:14:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:29,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825918673] [2024-11-07 06:14:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825918673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:29,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:14:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029554999] [2024-11-07 06:14:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:29,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:14:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:14:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:14:29,623 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:14:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:29,664 INFO L93 Difference]: Finished difference Result 223 states and 388 transitions. [2024-11-07 06:14:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:14:29,667 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:14:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:29,675 INFO L225 Difference]: With dead ends: 223 [2024-11-07 06:14:29,675 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 06:14:29,681 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:14:29,685 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 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:14:29,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:14:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 06:14:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-07 06:14:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 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:14:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2024-11-07 06:14:29,737 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 214 [2024-11-07 06:14:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:29,740 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2024-11-07 06:14:29,741 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:14:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2024-11-07 06:14:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:14:29,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:29,743 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:14:29,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:14:29,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:29,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1112696448, now seen corresponding path program 1 times [2024-11-07 06:14:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:29,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152694180] [2024-11-07 06:14:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:32,902 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:14:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152694180] [2024-11-07 06:14:32,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152694180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:32,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:32,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 06:14:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293583815] [2024-11-07 06:14:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:14:32,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:32,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:14:32,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:14:32,909 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:14:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:35,079 INFO L93 Difference]: Finished difference Result 309 states and 466 transitions. [2024-11-07 06:14:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:14:35,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 215 [2024-11-07 06:14:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:35,082 INFO L225 Difference]: With dead ends: 309 [2024-11-07 06:14:35,082 INFO L226 Difference]: Without dead ends: 204 [2024-11-07 06:14:35,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-07 06:14:35,087 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 669 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:35,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 482 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 06:14:35,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-07 06:14:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 146. [2024-11-07 06:14:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 110 states have internal predecessors, (156), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2024-11-07 06:14:35,120 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 215 [2024-11-07 06:14:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:35,121 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2024-11-07 06:14:35,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:14:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2024-11-07 06:14:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:14:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:35,127 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:14:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:14:35,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1376832514, now seen corresponding path program 1 times [2024-11-07 06:14:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916252937] [2024-11-07 06:14:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:36,686 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:14:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:36,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916252937] [2024-11-07 06:14:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916252937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:36,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:36,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:14:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326916844] [2024-11-07 06:14:36,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:14:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:14:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:14:36,688 INFO L87 Difference]: Start difference. First operand 146 states and 222 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:14:40,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 06:14:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:40,594 INFO L93 Difference]: Finished difference Result 416 states and 633 transitions. [2024-11-07 06:14:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:14:40,595 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:14:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:40,597 INFO L225 Difference]: With dead ends: 416 [2024-11-07 06:14:40,597 INFO L226 Difference]: Without dead ends: 273 [2024-11-07 06:14:40,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:14:40,599 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 120 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:40,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 775 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-07 06:14:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-07 06:14:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 153. [2024-11-07 06:14:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 117 states have internal predecessors, (167), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2024-11-07 06:14:40,616 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 215 [2024-11-07 06:14:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:40,616 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2024-11-07 06:14:40,616 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:14:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2024-11-07 06:14:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:14:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:40,619 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:14:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:14:40,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1050656834, now seen corresponding path program 1 times [2024-11-07 06:14:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083366847] [2024-11-07 06:14:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:43,319 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:14:43,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:43,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083366847] [2024-11-07 06:14:43,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083366847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:43,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 06:14:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202319670] [2024-11-07 06:14:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:43,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:14:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:43,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:14:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:14:43,324 INFO L87 Difference]: Start difference. First operand 153 states and 233 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:14:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:45,760 INFO L93 Difference]: Finished difference Result 438 states and 662 transitions. [2024-11-07 06:14:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:14:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 215 [2024-11-07 06:14:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:45,765 INFO L225 Difference]: With dead ends: 438 [2024-11-07 06:14:45,765 INFO L226 Difference]: Without dead ends: 288 [2024-11-07 06:14:45,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:14:45,767 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 480 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:45,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 597 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 06:14:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-07 06:14:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 153. [2024-11-07 06:14:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 117 states have internal predecessors, (167), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2024-11-07 06:14:45,791 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 215 [2024-11-07 06:14:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:45,793 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2024-11-07 06:14:45,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 06:14:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2024-11-07 06:14:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:14:45,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:45,794 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:14:45,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:14:45,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:45,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:45,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1438872128, now seen corresponding path program 1 times [2024-11-07 06:14:45,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:45,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510650851] [2024-11-07 06:14:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:45,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:47,754 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:14:47,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:47,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510650851] [2024-11-07 06:14:47,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510650851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:47,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:47,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:14:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096670821] [2024-11-07 06:14:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:47,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:14:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:14:47,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:14:47,756 INFO L87 Difference]: Start difference. First operand 153 states and 233 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:14:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:48,770 INFO L93 Difference]: Finished difference Result 425 states and 646 transitions. [2024-11-07 06:14:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:14:48,770 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:14:48,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:48,772 INFO L225 Difference]: With dead ends: 425 [2024-11-07 06:14:48,772 INFO L226 Difference]: Without dead ends: 275 [2024-11-07 06:14:48,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:14:48,774 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 120 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:48,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 942 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:14:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-07 06:14:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 153. [2024-11-07 06:14:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 117 states have internal predecessors, (167), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2024-11-07 06:14:48,784 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 215 [2024-11-07 06:14:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:48,785 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2024-11-07 06:14:48,787 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:14:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2024-11-07 06:14:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:14:48,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:48,790 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:14:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:14:48,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:48,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash 867359424, now seen corresponding path program 1 times [2024-11-07 06:14:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:48,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044513688] [2024-11-07 06:14:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:50,096 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:14:50,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:50,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044513688] [2024-11-07 06:14:50,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044513688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:50,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:50,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:14:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670049013] [2024-11-07 06:14:50,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:50,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:14:50,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:50,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:14:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:14:50,098 INFO L87 Difference]: Start difference. First operand 153 states and 233 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:14:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:50,710 INFO L93 Difference]: Finished difference Result 391 states and 592 transitions. [2024-11-07 06:14:50,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:14:50,710 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:14:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:50,712 INFO L225 Difference]: With dead ends: 391 [2024-11-07 06:14:50,712 INFO L226 Difference]: Without dead ends: 241 [2024-11-07 06:14:50,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 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:14:50,713 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 171 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:50,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 880 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:14:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-07 06:14:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 148. [2024-11-07 06:14:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 112 states have (on average 1.4196428571428572) internal successors, (159), 112 states have internal predecessors, (159), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2024-11-07 06:14:50,723 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 215 [2024-11-07 06:14:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:50,724 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2024-11-07 06:14:50,724 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:14:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2024-11-07 06:14:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 06:14:50,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:50,728 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:14:50,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:14:50,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:50,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1560129924, now seen corresponding path program 1 times [2024-11-07 06:14:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913140494] [2024-11-07 06:14:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:51,382 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:14:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913140494] [2024-11-07 06:14:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913140494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:51,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:51,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:14:51,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570895510] [2024-11-07 06:14:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:51,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:14:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:14:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:14:51,384 INFO L87 Difference]: Start difference. First operand 148 states and 225 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:14:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:51,877 INFO L93 Difference]: Finished difference Result 359 states and 540 transitions. [2024-11-07 06:14:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:14:51,879 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:14:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:51,880 INFO L225 Difference]: With dead ends: 359 [2024-11-07 06:14:51,882 INFO L226 Difference]: Without dead ends: 214 [2024-11-07 06:14:51,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:14:51,884 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 120 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:51,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 975 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:14:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-07 06:14:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 114. [2024-11-07 06:14:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2024-11-07 06:14:51,897 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 215 [2024-11-07 06:14:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:51,898 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2024-11-07 06:14:51,898 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:14:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2024-11-07 06:14:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:14:51,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:51,899 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:14:51,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:14:51,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash -402880229, now seen corresponding path program 1 times [2024-11-07 06:14:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478510056] [2024-11-07 06:14:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,093 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:14:52,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:52,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478510056] [2024-11-07 06:14:52,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478510056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:14:52,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215624045] [2024-11-07 06:14:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:52,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:14:52,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:14:52,096 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:14:52,097 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:14:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:52,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 06:14:52,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:14:52,707 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:14:52,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:14:53,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215624045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:14:53,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:14:53,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-11-07 06:14:53,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230521612] [2024-11-07 06:14:53,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:14:53,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:14:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:53,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:14:53,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=50, Unknown=3, NotChecked=0, Total=72 [2024-11-07 06:14:53,776 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (65), 3 states have call predecessors, (65), 4 states have return successors, (65), 3 states have call predecessors, (65), 4 states have call successors, (65) [2024-11-07 06:14:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:54,005 INFO L93 Difference]: Finished difference Result 231 states and 342 transitions. [2024-11-07 06:14:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 06:14:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (65), 3 states have call predecessors, (65), 4 states have return successors, (65), 3 states have call predecessors, (65), 4 states have call successors, (65) Word has length 217 [2024-11-07 06:14:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:54,008 INFO L225 Difference]: With dead ends: 231 [2024-11-07 06:14:54,008 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 06:14:54,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=124, Unknown=3, NotChecked=0, Total=182 [2024-11-07 06:14:54,011 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 211 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:54,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 268 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:14:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 06:14:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-11-07 06:14:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-07 06:14:54,020 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 217 [2024-11-07 06:14:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-07 06:14:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (65), 3 states have call predecessors, (65), 4 states have return successors, (65), 3 states have call predecessors, (65), 4 states have call successors, (65) [2024-11-07 06:14:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-07 06:14:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:14:54,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:54,022 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:14:54,037 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:14:54,222 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:14:54,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:54,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash -262331619, now seen corresponding path program 1 times [2024-11-07 06:14:54,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:54,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95336501] [2024-11-07 06:14:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:54,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:14:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905374853] [2024-11-07 06:14:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:54,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:14:54,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:14:54,287 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:14:54,289 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:14:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:54,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 06:14:54,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:14:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 506 proven. 84 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2024-11-07 06:14:55,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:14:55,300 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:14:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:55,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95336501] [2024-11-07 06:14:55,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:14:55,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905374853] [2024-11-07 06:14:55,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905374853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:14:55,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:14:55,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-07 06:14:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880084789] [2024-11-07 06:14:55,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:14:55,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 06:14:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 06:14:55,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 06:14:55,303 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2024-11-07 06:14:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:56,438 INFO L93 Difference]: Finished difference Result 347 states and 490 transitions. [2024-11-07 06:14:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 06:14:56,439 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) Word has length 217 [2024-11-07 06:14:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:56,441 INFO L225 Difference]: With dead ends: 347 [2024-11-07 06:14:56,443 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 06:14:56,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2024-11-07 06:14:56,445 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 365 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:56,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1305 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:14:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 06:14:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 177. [2024-11-07 06:14:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 139 states have internal predecessors, (190), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2024-11-07 06:14:56,460 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 217 [2024-11-07 06:14:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2024-11-07 06:14:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 4 states have call predecessors, (64), 4 states have call successors, (64) [2024-11-07 06:14:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2024-11-07 06:14:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:14:56,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:56,463 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:14:56,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 06:14:56,664 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:14:56,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -399843546, now seen corresponding path program 1 times [2024-11-07 06:14:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83810686] [2024-11-07 06:14:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:56,813 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:14:56,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:56,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83810686] [2024-11-07 06:14:56,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83810686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:56,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:56,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:14:56,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612950735] [2024-11-07 06:14:56,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:56,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:14:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:56,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:14:56,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:14:56,815 INFO L87 Difference]: Start difference. First operand 177 states and 256 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:14:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:56,968 INFO L93 Difference]: Finished difference Result 429 states and 618 transitions. [2024-11-07 06:14:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:14:56,968 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:14:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:56,971 INFO L225 Difference]: With dead ends: 429 [2024-11-07 06:14:56,971 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 06:14:56,972 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:14:56,974 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 137 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:56,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 312 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:14:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 06:14:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 177. [2024-11-07 06:14:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 06:14:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 255 transitions. [2024-11-07 06:14:57,004 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 255 transitions. Word has length 217 [2024-11-07 06:14:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:57,005 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 255 transitions. [2024-11-07 06:14:57,005 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:14:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2024-11-07 06:14:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:14:57,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:57,009 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:14:57,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 06:14:57,009 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:57,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash -98078266, now seen corresponding path program 1 times [2024-11-07 06:14:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:57,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230577750] [2024-11-07 06:14:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:57,736 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:14:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230577750] [2024-11-07 06:14:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230577750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:57,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:57,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:14:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877971636] [2024-11-07 06:14:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:57,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:14:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:14:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:14:57,738 INFO L87 Difference]: Start difference. First operand 177 states and 255 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:14:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:58,370 INFO L93 Difference]: Finished difference Result 663 states and 934 transitions. [2024-11-07 06:14:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:14:58,370 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:14:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:58,374 INFO L225 Difference]: With dead ends: 663 [2024-11-07 06:14:58,374 INFO L226 Difference]: Without dead ends: 489 [2024-11-07 06:14:58,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:14:58,376 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 237 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:58,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 864 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:14:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-07 06:14:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 346. [2024-11-07 06:14:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 293 states have (on average 1.3993174061433447) internal successors, (410), 294 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:14:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 498 transitions. [2024-11-07 06:14:58,421 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 498 transitions. Word has length 217 [2024-11-07 06:14:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:58,421 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 498 transitions. [2024-11-07 06:14:58,421 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:14:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 498 transitions. [2024-11-07 06:14:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:14:58,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:58,423 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:14:58,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 06:14:58,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:58,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -607551356, now seen corresponding path program 1 times [2024-11-07 06:14:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:58,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884938244] [2024-11-07 06:14:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:14:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:14:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:14:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:14:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:14:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:14:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:14:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:14:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:14:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:14:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:14:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:14:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:14:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:14:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:14:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:14:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:14:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:14:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:14:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:14:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:14:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:14:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:14:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:14:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:14:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:14:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:14:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:14:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:14:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:14:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:14:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:14:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:14:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:14:59,065 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:14:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:14:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884938244] [2024-11-07 06:14:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884938244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:14:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:14:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:14:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380202247] [2024-11-07 06:14:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:14:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:14:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:14:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:14:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:14:59,067 INFO L87 Difference]: Start difference. First operand 346 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:14:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:14:59,850 INFO L93 Difference]: Finished difference Result 976 states and 1381 transitions. [2024-11-07 06:14:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:14:59,851 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:14:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:14:59,858 INFO L225 Difference]: With dead ends: 976 [2024-11-07 06:14:59,859 INFO L226 Difference]: Without dead ends: 633 [2024-11-07 06:14:59,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:14:59,861 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 202 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:14:59,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 760 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 06:14:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-07 06:14:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 363. [2024-11-07 06:14:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 310 states have (on average 1.4096774193548387) internal successors, (437), 311 states have internal predecessors, (437), 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:14:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 525 transitions. [2024-11-07 06:14:59,899 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 525 transitions. Word has length 217 [2024-11-07 06:14:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:14:59,899 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 525 transitions. [2024-11-07 06:14:59,899 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:14:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 525 transitions. [2024-11-07 06:14:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:14:59,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:14:59,902 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:14:59,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 06:14:59,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:14:59,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:14:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2051011904, now seen corresponding path program 1 times [2024-11-07 06:14:59,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:14:59,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387491577] [2024-11-07 06:14:59,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:14:59,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:14:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:15:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:15:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:15:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:15:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:15:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:15:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:15:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:15:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:15:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:15:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:15:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:15:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:15:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:15:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:15:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:15:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:15:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:15:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:15:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:15:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:15:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:15:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:15:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:15:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:15:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:15:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:15:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:15:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:15:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:15:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:15:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:15:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:15:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:01,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:15:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:15:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387491577] [2024-11-07 06:15:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387491577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:15:01,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:15:01,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 06:15:01,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848972674] [2024-11-07 06:15:01,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:15:01,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 06:15:01,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:15:01,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 06:15:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:15:01,845 INFO L87 Difference]: Start difference. First operand 363 states and 525 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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:15:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:15:04,407 INFO L93 Difference]: Finished difference Result 990 states and 1411 transitions. [2024-11-07 06:15:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 06:15:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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:15:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:15:04,410 INFO L225 Difference]: With dead ends: 990 [2024-11-07 06:15:04,410 INFO L226 Difference]: Without dead ends: 630 [2024-11-07 06:15:04,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-07 06:15:04,412 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 329 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:15:04,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1653 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 06:15:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-07 06:15:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 463. [2024-11-07 06:15:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 410 states have (on average 1.421951219512195) internal successors, (583), 411 states have internal predecessors, (583), 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:15:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 671 transitions. [2024-11-07 06:15:04,434 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 671 transitions. Word has length 218 [2024-11-07 06:15:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:15:04,435 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 671 transitions. [2024-11-07 06:15:04,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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:15:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 671 transitions. [2024-11-07 06:15:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:15:04,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:04,436 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:15:04,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 06:15:04,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:04,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1942190112, now seen corresponding path program 1 times [2024-11-07 06:15:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:15:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89150204] [2024-11-07 06:15:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:15:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:15:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:15:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:15:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:15:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:15:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:15:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:15:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:15:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:15:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:15:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:15:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:15:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:15:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:15:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:15:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:15:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:15:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:15:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:15:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:15:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:15:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:15:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:15:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:15:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:15:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:15:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:15:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:15:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:15:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:15:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:15:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:15:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:15:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:05,064 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:15:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:15:05,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89150204] [2024-11-07 06:15:05,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89150204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:15:05,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:15:05,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 06:15:05,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039285254] [2024-11-07 06:15:05,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:15:05,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:15:05,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:15:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:15:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:15:05,067 INFO L87 Difference]: Start difference. First operand 463 states and 671 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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:15:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:15:06,061 INFO L93 Difference]: Finished difference Result 1223 states and 1737 transitions. [2024-11-07 06:15:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:15:06,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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:15:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:15:06,067 INFO L225 Difference]: With dead ends: 1223 [2024-11-07 06:15:06,068 INFO L226 Difference]: Without dead ends: 763 [2024-11-07 06:15:06,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:15:06,069 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 342 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:15:06,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 872 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:15:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-11-07 06:15:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 489. [2024-11-07 06:15:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 436 states have (on average 1.4243119266055047) internal successors, (621), 437 states have internal predecessors, (621), 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:15:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 709 transitions. [2024-11-07 06:15:06,109 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 709 transitions. Word has length 218 [2024-11-07 06:15:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:15:06,109 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 709 transitions. [2024-11-07 06:15:06,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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:15:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 709 transitions. [2024-11-07 06:15:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:15:06,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:06,111 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:15:06,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 06:15:06,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:06,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1910092553, now seen corresponding path program 1 times [2024-11-07 06:15:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:15:06,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941896078] [2024-11-07 06:15:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:15:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:15:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:15:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:15:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:15:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:15:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:15:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:15:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:15:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:15:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:15:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:15:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:15:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:15:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:15:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:15:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:15:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:15:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:15:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:15:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:15:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:15:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:15:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:15:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:15:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:15:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:15:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:15:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:15:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:15:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:15:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:15:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:15:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:15:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,440 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:15:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:15:06,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941896078] [2024-11-07 06:15:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941896078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:15:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:15:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:15:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075982535] [2024-11-07 06:15:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:15:06,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:15:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:15:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:15:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:15:06,442 INFO L87 Difference]: Start difference. First operand 489 states and 709 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:15:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:15:06,845 INFO L93 Difference]: Finished difference Result 1163 states and 1661 transitions. [2024-11-07 06:15:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:15:06,845 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:15:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:15:06,849 INFO L225 Difference]: With dead ends: 1163 [2024-11-07 06:15:06,849 INFO L226 Difference]: Without dead ends: 677 [2024-11-07 06:15:06,850 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:15:06,850 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 119 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:15:06,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 983 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:15:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-07 06:15:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 521. [2024-11-07 06:15:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 468 states have (on average 1.4337606837606838) internal successors, (671), 469 states have internal predecessors, (671), 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:15:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 759 transitions. [2024-11-07 06:15:06,882 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 759 transitions. Word has length 218 [2024-11-07 06:15:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:15:06,883 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 759 transitions. [2024-11-07 06:15:06,883 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:15:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 759 transitions. [2024-11-07 06:15:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:15:06,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:06,885 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:15:06,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 06:15:06,885 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:06,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2007300678, now seen corresponding path program 1 times [2024-11-07 06:15:06,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:15:06,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753613167] [2024-11-07 06:15:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:15:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:15:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:15:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:15:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:15:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 06:15:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:15:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 06:15:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:15:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:15:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:15:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:15:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:15:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:15:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:15:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:15:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:15:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:15:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:15:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:15:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:15:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:15:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:15:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 06:15:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:15:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 06:15:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:15:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:15:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 06:15:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 06:15:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 06:15:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 06:15:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 06:15:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 06:15:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:06,974 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:15:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:15:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753613167] [2024-11-07 06:15:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753613167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:15:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:15:06,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:15:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132577171] [2024-11-07 06:15:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:15:06,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:15:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:15:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:15:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:15:06,976 INFO L87 Difference]: Start difference. First operand 521 states and 759 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:15:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:15:07,052 INFO L93 Difference]: Finished difference Result 1161 states and 1692 transitions. [2024-11-07 06:15:07,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:15:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:15:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:15:07,057 INFO L225 Difference]: With dead ends: 1161 [2024-11-07 06:15:07,057 INFO L226 Difference]: Without dead ends: 643 [2024-11-07 06:15:07,059 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:15:07,059 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 39 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:15:07,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 318 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:15:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-07 06:15:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 553. [2024-11-07 06:15:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 500 states have (on average 1.442) internal successors, (721), 501 states have internal predecessors, (721), 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:15:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 809 transitions. [2024-11-07 06:15:07,096 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 809 transitions. Word has length 218 [2024-11-07 06:15:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:15:07,096 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 809 transitions. [2024-11-07 06:15:07,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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:15:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 809 transitions. [2024-11-07 06:15:07,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:15:07,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:07,098 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:15:07,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 06:15:07,099 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:07,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2091222600, now seen corresponding path program 1 times [2024-11-07 06:15:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:15:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585181110] [2024-11-07 06:15:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:15:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:15:07,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314713150] [2024-11-07 06:15:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:07,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:15:07,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:15:07,161 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:15:07,162 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:15:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:15:07,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:15:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:15:07,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:15:07,455 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:15:07,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:15:07,472 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:15:07,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:15:07,663 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:15:07,766 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:15:07,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:15:07 BoogieIcfgContainer [2024-11-07 06:15:07,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:15:07,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:15:07,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:15:07,770 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:15:07,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:14:28" (3/4) ... [2024-11-07 06:15:07,771 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:15:07,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:15:07,773 INFO L158 Benchmark]: Toolchain (without parser) took 39967.01ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 93.5MB in the beginning and 245.6MB in the end (delta: -152.1MB). Peak memory consumption was 253.9MB. Max. memory is 16.1GB. [2024-11-07 06:15:07,773 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:15:07,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.09ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 77.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:15:07,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.99ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 74.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:15:07,774 INFO L158 Benchmark]: Boogie Preprocessor took 74.08ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 70.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:15:07,774 INFO L158 Benchmark]: RCFGBuilder took 546.85ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 41.3MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 06:15:07,774 INFO L158 Benchmark]: TraceAbstraction took 38967.22ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 40.7MB in the beginning and 245.7MB in the end (delta: -205.0MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. [2024-11-07 06:15:07,774 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 520.1MB. Free memory was 245.7MB in the beginning and 245.6MB in the end (delta: 88.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:15:07,778 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.24ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.09ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 77.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.99ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 74.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.08ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 70.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 546.85ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 41.3MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38967.22ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 40.7MB in the beginning and 245.7MB in the end (delta: -205.0MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 520.1MB. Free memory was 245.7MB in the beginning and 245.6MB in the end (delta: 88.2kB). Peak memory consumption was 8.4MB. 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=6, 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=4, 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=6, 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=4, 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=6, 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=4, 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=6, 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=4, 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=6, 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=4, 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=6, 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=4, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=16, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_12=6, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L60] 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=4, var_1_12=6, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L61] COND TRUE var_1_6 <= stepLocal_2 [L62] 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=4, var_1_11=4, var_1_12=6, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L66] 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=4, var_1_11=4, var_1_12=6, var_1_13=128, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L66] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L73] 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L75] var_1_18 = var_1_3 [L76] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L77] 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L78] COND FALSE !((- var_1_9) <= var_1_8) [L91] 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L93] 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L94] 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L94] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L95] 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, 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=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L102] COND TRUE var_1_20 || var_1_21 [L103] 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L105] 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, stepLocal_1=0, stepLocal_3=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L110] COND TRUE var_1_12 <= var_1_12 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L111] COND FALSE !(var_1_12 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27)) 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L125] 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_1=0, stepLocal_3=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L130] var_1_33 = var_1_34 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] [L131] COND FALSE !(((256 - var_1_25) <= (var_1_13 + var_1_16)) || 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=4, stepLocal_4=4, var_1_10=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, 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=4, var_1_11=4, var_1_12=6, var_1_13=6, var_1_15=256, var_1_16=4, var_1_18=0, var_1_19=4, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=0, var_1_25=245, var_1_26=32, var_1_27=-4294967295, 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=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.8s, OverallIterations: 17, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3667 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3661 mSDsluCounter, 12307 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9199 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6684 IncrementalHoareTripleChecker+Invalid, 6954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 3108 mSDtfsCounter, 6684 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1860 GetRequests, 1712 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=16, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1863 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 4331 NumberOfCodeBlocks, 4331 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3877 ConstructedInterpolants, 0 QuantifiedInterpolants, 17228 SizeOfPredicates, 6 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 37656/38016 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:15:07,930 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-pe-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 c5adc02aa856013d500f38fcfb7b074d7d479a50c6d427eda463f4ffd6df5ef0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:15:10,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:15:10,119 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:15:10,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:15:10,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:15:10,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:15:10,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:15:10,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:15:10,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:15:10,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:15:10,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:15:10,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:15:10,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:15:10,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:15:10,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:15:10,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:15:10,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:15:10,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:15:10,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:15:10,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:15:10,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:15:10,226 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:15:10,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:15:10,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:15:10,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:15:10,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:15:10,227 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 -> c5adc02aa856013d500f38fcfb7b074d7d479a50c6d427eda463f4ffd6df5ef0 [2024-11-07 06:15:10,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:15:10,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:15:10,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:15:10,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:15:10,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:15:10,541 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-pe-co_file-9.i [2024-11-07 06:15:11,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:15:12,243 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:15:12,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-9.i [2024-11-07 06:15:12,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cba970693/7baf1022e22a41d1826994648004a10c/FLAG8f4423f8f [2024-11-07 06:15:12,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cba970693/7baf1022e22a41d1826994648004a10c [2024-11-07 06:15:12,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:15:12,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:15:12,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:15:12,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:15:12,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:15:12,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1545ce9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12, skipping insertion in model container [2024-11-07 06:15:12,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:15:12,446 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-pe-co_file-9.i[918,931] [2024-11-07 06:15:12,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:15:12,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:15:12,561 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-pe-co_file-9.i[918,931] [2024-11-07 06:15:12,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:15:12,608 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:15:12,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12 WrapperNode [2024-11-07 06:15:12,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:15:12,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:15:12,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:15:12,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:15:12,617 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:15:12" (1/1) ... [2024-11-07 06:15:12,627 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:15:12" (1/1) ... [2024-11-07 06:15:12,658 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-07 06:15:12,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:15:12,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:15:12,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:15:12,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:15:12,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,688 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:15:12,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:15:12,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:15:12,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:15:12,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:15:12,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (1/1) ... [2024-11-07 06:15:12,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:15:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:15:12,754 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:15:12,758 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:15:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:15:12,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:15:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:15:12,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:15:12,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:15:12,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:15:12,886 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:15:12,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:15:22,380 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:15:22,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:15:22,393 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:15:22,396 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:15:22,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:15:22 BoogieIcfgContainer [2024-11-07 06:15:22,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:15:22,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:15:22,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:15:22,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:15:22,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:15:12" (1/3) ... [2024-11-07 06:15:22,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:15:22, skipping insertion in model container [2024-11-07 06:15:22,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:12" (2/3) ... [2024-11-07 06:15:22,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:15:22, skipping insertion in model container [2024-11-07 06:15:22,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:15:22" (3/3) ... [2024-11-07 06:15:22,404 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-9.i [2024-11-07 06:15:22,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:15:22,414 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:15:22,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:15:22,486 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;@15e7b716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:15:22,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:15:22,491 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:15:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 06:15:22,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:22,503 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:15:22,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:22,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1742772061, now seen corresponding path program 1 times [2024-11-07 06:15:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:15:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598953359] [2024-11-07 06:15:22,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:22,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:15:22,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:15:22,522 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:15:22,524 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:15:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:24,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:15:24,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:15:24,631 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:15:24,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:15:24,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:15:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598953359] [2024-11-07 06:15:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598953359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:15:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:15:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:15:24,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843536586] [2024-11-07 06:15:24,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:15:24,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:15:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:15:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:15:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:15:24,651 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:15:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:15:24,671 INFO L93 Difference]: Finished difference Result 180 states and 325 transitions. [2024-11-07 06:15:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:15:24,672 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:15:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:15:24,677 INFO L225 Difference]: With dead ends: 180 [2024-11-07 06:15:24,677 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 06:15:24,680 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:15:24,682 INFO L432 NwaCegarLoop]: 136 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, 136 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:15:24,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:15:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 06:15:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-07 06:15:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 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:15:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-11-07 06:15:24,719 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 206 [2024-11-07 06:15:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:15:24,719 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-11-07 06:15:24,720 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:15:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-11-07 06:15:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-07 06:15:24,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:24,724 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:15:24,769 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:15:24,928 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:15:24,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1550026082, now seen corresponding path program 1 times [2024-11-07 06:15:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:15:24,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955974319] [2024-11-07 06:15:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:24,934 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:15:24,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:15:24,937 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:15:24,939 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:15:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:26,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 06:15:26,549 INFO L278 TraceCheckSpWp]: Computing forward predicates...