./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.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', '2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:50:16,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:50:16,556 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:50:16,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:50:16,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:50:16,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:50:16,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:50:16,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:50:16,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:50:16,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:50:16,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:50:16,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:50:16,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:50:16,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:50:16,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:50:16,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:50:16,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:50:16,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:50:16,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:50:16,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:50:16,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:50:16,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:50:16,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:50:16,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:50:16,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:50:16,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:50:16,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:50:16,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:50:16,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:16,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:50:16,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:50:16,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:50:16,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:50:16,597 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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-11-07 06:50:16,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:50:16,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:50:16,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:50:16,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:50:16,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:50:16,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-07 06:50:18,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:50:18,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:50:18,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-07 06:50:18,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2a08ad7/80c271e4dbda4a1ebfbd4df4cc269819/FLAG20ddf2711 [2024-11-07 06:50:18,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2a08ad7/80c271e4dbda4a1ebfbd4df4cc269819 [2024-11-07 06:50:18,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:50:18,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:50:18,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:18,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:50:18,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:50:18,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:18" (1/1) ... [2024-11-07 06:50:18,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14fa14be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:18, skipping insertion in model container [2024-11-07 06:50:18,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:18" (1/1) ... [2024-11-07 06:50:18,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:50:19,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-07 06:50:19,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:19,193 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:50:19,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-07 06:50:19,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:19,273 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:50:19,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19 WrapperNode [2024-11-07 06:50:19,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:19,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:19,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:50:19,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:50:19,279 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:50:19" (1/1) ... [2024-11-07 06:50:19,288 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:50:19" (1/1) ... [2024-11-07 06:50:19,327 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 287 [2024-11-07 06:50:19,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:19,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:50:19,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:50:19,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:50:19,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,360 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:50:19,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:50:19,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:50:19,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:50:19,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:50:19,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (1/1) ... [2024-11-07 06:50:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:19,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:19,419 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:50:19,423 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:50:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:50:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:50:19,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:50:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:50:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:50:19,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:50:19,561 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:50:19,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:50:20,006 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:50:20,007 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:50:20,021 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:50:20,022 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:50:20,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:20 BoogieIcfgContainer [2024-11-07 06:50:20,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:50:20,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:50:20,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:50:20,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:50:20,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:50:18" (1/3) ... [2024-11-07 06:50:20,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f82af70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:20, skipping insertion in model container [2024-11-07 06:50:20,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:19" (2/3) ... [2024-11-07 06:50:20,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f82af70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:20, skipping insertion in model container [2024-11-07 06:50:20,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:20" (3/3) ... [2024-11-07 06:50:20,032 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-07 06:50:20,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:50:20,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:50:20,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:50:20,117 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;@6e42adf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:50:20,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:50:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 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:50:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 06:50:20,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:20,138 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] [2024-11-07 06:50:20,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:20,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash 237656672, now seen corresponding path program 1 times [2024-11-07 06:50:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369750258] [2024-11-07 06:50:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:21,408 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:50:21,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369750258] [2024-11-07 06:50:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369750258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:50:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893276316] [2024-11-07 06:50:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:21,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:50:21,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:50:21,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:50:21,446 INFO L87 Difference]: Start difference. First operand has 122 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 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 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:50:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:21,915 INFO L93 Difference]: Finished difference Result 380 states and 683 transitions. [2024-11-07 06:50:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:50:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 213 [2024-11-07 06:50:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:21,931 INFO L225 Difference]: With dead ends: 380 [2024-11-07 06:50:21,932 INFO L226 Difference]: Without dead ends: 261 [2024-11-07 06:50:21,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:50:21,944 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 243 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:21,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 483 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:50:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-07 06:50:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 229. [2024-11-07 06:50:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 160 states have (on average 1.45625) internal successors, (233), 160 states have internal predecessors, (233), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:50:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 365 transitions. [2024-11-07 06:50:22,058 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 365 transitions. Word has length 213 [2024-11-07 06:50:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:22,061 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 365 transitions. [2024-11-07 06:50:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:50:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 365 transitions. [2024-11-07 06:50:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:50:22,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:22,068 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:50:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:50:22,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:22,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash -377513104, now seen corresponding path program 1 times [2024-11-07 06:50:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917967908] [2024-11-07 06:50:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,379 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:50:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:22,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917967908] [2024-11-07 06:50:22,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917967908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:22,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:50:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222107371] [2024-11-07 06:50:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:22,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:50:22,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:22,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:50:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:50:22,384 INFO L87 Difference]: Start difference. First operand 229 states and 365 transitions. 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:50:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:22,524 INFO L93 Difference]: Finished difference Result 679 states and 1085 transitions. [2024-11-07 06:50:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:50:22,525 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:50:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:22,532 INFO L225 Difference]: With dead ends: 679 [2024-11-07 06:50:22,532 INFO L226 Difference]: Without dead ends: 453 [2024-11-07 06:50:22,535 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:50:22,536 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 163 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:22,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 408 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:50:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-07 06:50:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 451. [2024-11-07 06:50:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 314 states have (on average 1.4522292993630572) internal successors, (456), 314 states have internal predecessors, (456), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-07 06:50:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 720 transitions. [2024-11-07 06:50:22,616 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 720 transitions. Word has length 214 [2024-11-07 06:50:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:22,618 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 720 transitions. [2024-11-07 06:50:22,618 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:50:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 720 transitions. [2024-11-07 06:50:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:50:22,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:22,624 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:50:22,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:50:22,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 80534128, now seen corresponding path program 1 times [2024-11-07 06:50:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356456687] [2024-11-07 06:50:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:22,982 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:50:22,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:22,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356456687] [2024-11-07 06:50:22,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356456687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:22,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:22,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:50:22,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977542686] [2024-11-07 06:50:22,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:22,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:50:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:50:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:50:22,986 INFO L87 Difference]: Start difference. First operand 451 states and 720 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:50:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:23,745 INFO L93 Difference]: Finished difference Result 1700 states and 2691 transitions. [2024-11-07 06:50:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:50:23,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:50:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:23,761 INFO L225 Difference]: With dead ends: 1700 [2024-11-07 06:50:23,763 INFO L226 Difference]: Without dead ends: 1252 [2024-11-07 06:50:23,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:50:23,768 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 425 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:23,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 592 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:50:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-07 06:50:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1238. [2024-11-07 06:50:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 937 states have (on average 1.48025613660619) internal successors, (1387), 945 states have internal predecessors, (1387), 286 states have call successors, (286), 14 states have call predecessors, (286), 14 states have return successors, (286), 278 states have call predecessors, (286), 286 states have call successors, (286) [2024-11-07 06:50:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1959 transitions. [2024-11-07 06:50:23,978 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1959 transitions. Word has length 214 [2024-11-07 06:50:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:23,978 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1959 transitions. [2024-11-07 06:50:23,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:50:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1959 transitions. [2024-11-07 06:50:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:50:23,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:23,982 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:50:23,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:50:23,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash 633604146, now seen corresponding path program 1 times [2024-11-07 06:50:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:23,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768329691] [2024-11-07 06:50:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:24,636 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:50:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:24,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768329691] [2024-11-07 06:50:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768329691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:24,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:24,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:50:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119340926] [2024-11-07 06:50:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:24,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:50:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:24,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:50:24,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:50:24,638 INFO L87 Difference]: Start difference. First operand 1238 states and 1959 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:50:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:25,447 INFO L93 Difference]: Finished difference Result 1800 states and 2833 transitions. [2024-11-07 06:50:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:50:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:50:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:25,462 INFO L225 Difference]: With dead ends: 1800 [2024-11-07 06:50:25,463 INFO L226 Difference]: Without dead ends: 1575 [2024-11-07 06:50:25,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:50:25,467 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 325 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:25,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 726 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:50:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-07 06:50:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1556. [2024-11-07 06:50:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1204 states have (on average 1.4883720930232558) internal successors, (1792), 1217 states have internal predecessors, (1792), 332 states have call successors, (332), 19 states have call predecessors, (332), 19 states have return successors, (332), 319 states have call predecessors, (332), 332 states have call successors, (332) [2024-11-07 06:50:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2456 transitions. [2024-11-07 06:50:25,645 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2456 transitions. Word has length 214 [2024-11-07 06:50:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:25,646 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2456 transitions. [2024-11-07 06:50:25,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:50:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2456 transitions. [2024-11-07 06:50:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 06:50:25,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:25,650 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:50:25,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:50:25,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:25,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash 142573742, now seen corresponding path program 1 times [2024-11-07 06:50:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195479493] [2024-11-07 06:50:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,030 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:50:26,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:26,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195479493] [2024-11-07 06:50:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195479493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:26,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:26,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:50:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400229466] [2024-11-07 06:50:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:26,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:50:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:50:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:50:26,032 INFO L87 Difference]: Start difference. First operand 1556 states and 2456 transitions. 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:50:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:26,210 INFO L93 Difference]: Finished difference Result 2603 states and 4109 transitions. [2024-11-07 06:50:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:50:26,211 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:50:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:26,221 INFO L225 Difference]: With dead ends: 2603 [2024-11-07 06:50:26,221 INFO L226 Difference]: Without dead ends: 1050 [2024-11-07 06:50:26,226 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:50:26,227 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 119 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:26,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 315 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:50:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-07 06:50:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1048. [2024-11-07 06:50:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 812 states have (on average 1.4642857142857142) internal successors, (1189), 821 states have internal predecessors, (1189), 222 states have call successors, (222), 13 states have call predecessors, (222), 13 states have return successors, (222), 213 states have call predecessors, (222), 222 states have call successors, (222) [2024-11-07 06:50:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1633 transitions. [2024-11-07 06:50:26,333 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1633 transitions. Word has length 214 [2024-11-07 06:50:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:26,334 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1633 transitions. [2024-11-07 06:50:26,334 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:50:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1633 transitions. [2024-11-07 06:50:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-07 06:50:26,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:26,337 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] [2024-11-07 06:50:26,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:50:26,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:26,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1562897297, now seen corresponding path program 1 times [2024-11-07 06:50:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733039964] [2024-11-07 06:50:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:26,758 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:50:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733039964] [2024-11-07 06:50:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733039964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:50:26,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468585797] [2024-11-07 06:50:26,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:26,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:50:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:50:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:50:26,761 INFO L87 Difference]: Start difference. First operand 1048 states and 1633 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:50:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:26,983 INFO L93 Difference]: Finished difference Result 1803 states and 2821 transitions. [2024-11-07 06:50:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:50:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 216 [2024-11-07 06:50:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:26,992 INFO L225 Difference]: With dead ends: 1803 [2024-11-07 06:50:26,992 INFO L226 Difference]: Without dead ends: 758 [2024-11-07 06:50:26,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:50:26,997 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 143 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:26,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 527 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:50:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-07 06:50:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 672. [2024-11-07 06:50:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 518 states have (on average 1.472972972972973) internal successors, (763), 523 states have internal predecessors, (763), 145 states have call successors, (145), 8 states have call predecessors, (145), 8 states have return successors, (145), 140 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-07 06:50:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1053 transitions. [2024-11-07 06:50:27,063 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1053 transitions. Word has length 216 [2024-11-07 06:50:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:27,064 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1053 transitions. [2024-11-07 06:50:27,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:50:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1053 transitions. [2024-11-07 06:50:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-07 06:50:27,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:27,067 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] [2024-11-07 06:50:27,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:50:27,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:27,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1720952749, now seen corresponding path program 1 times [2024-11-07 06:50:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:27,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214443811] [2024-11-07 06:50:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:27,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:28,183 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:50:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214443811] [2024-11-07 06:50:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214443811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:28,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 06:50:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11378708] [2024-11-07 06:50:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:28,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:50:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:50:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:50:28,186 INFO L87 Difference]: Start difference. First operand 672 states and 1053 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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:50:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:29,274 INFO L93 Difference]: Finished difference Result 1409 states and 2200 transitions. [2024-11-07 06:50:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:50:29,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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 216 [2024-11-07 06:50:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:29,281 INFO L225 Difference]: With dead ends: 1409 [2024-11-07 06:50:29,281 INFO L226 Difference]: Without dead ends: 848 [2024-11-07 06:50:29,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:50:29,284 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 406 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:29,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 605 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:50:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-07 06:50:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 824. [2024-11-07 06:50:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 646 states have (on average 1.4659442724458205) internal successors, (947), 653 states have internal predecessors, (947), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-07 06:50:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1277 transitions. [2024-11-07 06:50:29,343 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1277 transitions. Word has length 216 [2024-11-07 06:50:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:29,344 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1277 transitions. [2024-11-07 06:50:29,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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:50:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1277 transitions. [2024-11-07 06:50:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:50:29,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:29,349 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:50:29,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:50:29,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:29,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1475066503, now seen corresponding path program 1 times [2024-11-07 06:50:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:29,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975945042] [2024-11-07 06:50:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,507 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:50:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:29,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975945042] [2024-11-07 06:50:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975945042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:29,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:50:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733584347] [2024-11-07 06:50:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:29,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:50:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:50:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:50:29,509 INFO L87 Difference]: Start difference. First operand 824 states and 1277 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:50:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:29,641 INFO L93 Difference]: Finished difference Result 2084 states and 3232 transitions. [2024-11-07 06:50:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:50:29,642 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:50:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:29,652 INFO L225 Difference]: With dead ends: 2084 [2024-11-07 06:50:29,653 INFO L226 Difference]: Without dead ends: 1447 [2024-11-07 06:50:29,655 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:50:29,656 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 174 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:29,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 346 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:50:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-11-07 06:50:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 923. [2024-11-07 06:50:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 745 states have (on average 1.4845637583892617) internal successors, (1106), 752 states have internal predecessors, (1106), 165 states have call successors, (165), 12 states have call predecessors, (165), 12 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-07 06:50:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1436 transitions. [2024-11-07 06:50:29,732 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1436 transitions. Word has length 217 [2024-11-07 06:50:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:29,733 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1436 transitions. [2024-11-07 06:50:29,733 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:50:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1436 transitions. [2024-11-07 06:50:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:50:29,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:29,737 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:50:29,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 06:50:29,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1868093513, now seen corresponding path program 1 times [2024-11-07 06:50:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590531583] [2024-11-07 06:50:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:50:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:30,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590531583] [2024-11-07 06:50:30,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590531583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:50:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862079738] [2024-11-07 06:50:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:30,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:30,082 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:50:30,103 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:50:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:30,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:50:30,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-11-07 06:50:30,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:50:30,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862079738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:30,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:50:30,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:50:30,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422368593] [2024-11-07 06:50:30,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:30,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:50:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:30,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:50:30,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:50:30,749 INFO L87 Difference]: Start difference. First operand 923 states and 1436 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 06:50:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:31,049 INFO L93 Difference]: Finished difference Result 1724 states and 2666 transitions. [2024-11-07 06:50:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:50:31,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 217 [2024-11-07 06:50:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:31,058 INFO L225 Difference]: With dead ends: 1724 [2024-11-07 06:50:31,059 INFO L226 Difference]: Without dead ends: 941 [2024-11-07 06:50:31,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:50:31,063 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 124 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:31,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 368 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:50:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-07 06:50:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 935. [2024-11-07 06:50:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 754 states have (on average 1.4496021220159152) internal successors, (1093), 761 states have internal predecessors, (1093), 165 states have call successors, (165), 15 states have call predecessors, (165), 15 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-07 06:50:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1423 transitions. [2024-11-07 06:50:31,139 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1423 transitions. Word has length 217 [2024-11-07 06:50:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:31,139 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1423 transitions. [2024-11-07 06:50:31,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 06:50:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1423 transitions. [2024-11-07 06:50:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:50:31,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:31,143 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:50:31,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:50:31,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:31,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:31,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:31,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1050445063, now seen corresponding path program 1 times [2024-11-07 06:50:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:31,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966804585] [2024-11-07 06:50:31,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:31,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:50:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966804585] [2024-11-07 06:50:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966804585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:50:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721328185] [2024-11-07 06:50:33,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:33,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:33,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:33,186 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:50:33,188 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:50:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:33,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 06:50:33,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-07 06:50:33,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:50:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721328185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:33,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:50:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2024-11-07 06:50:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435574671] [2024-11-07 06:50:33,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:33,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 06:50:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 06:50:33,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:50:33,905 INFO L87 Difference]: Start difference. First operand 935 states and 1423 transitions. Second operand has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 5 states have call predecessors, (80), 6 states have call successors, (80) [2024-11-07 06:50:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:36,241 INFO L93 Difference]: Finished difference Result 1626 states and 2451 transitions. [2024-11-07 06:50:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 06:50:36,242 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 5 states have call predecessors, (80), 6 states have call successors, (80) Word has length 217 [2024-11-07 06:50:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:36,249 INFO L225 Difference]: With dead ends: 1626 [2024-11-07 06:50:36,249 INFO L226 Difference]: Without dead ends: 878 [2024-11-07 06:50:36,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 496 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 06:50:36,255 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 858 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:36,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 919 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 06:50:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-07 06:50:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 853. [2024-11-07 06:50:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 668 states have (on average 1.3817365269461077) internal successors, (923), 675 states have internal predecessors, (923), 165 states have call successors, (165), 19 states have call predecessors, (165), 19 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-07 06:50:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1253 transitions. [2024-11-07 06:50:36,323 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1253 transitions. Word has length 217 [2024-11-07 06:50:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:36,323 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1253 transitions. [2024-11-07 06:50:36,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.0) internal successors, (105), 16 states have internal predecessors, (105), 6 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 5 states have call predecessors, (80), 6 states have call successors, (80) [2024-11-07 06:50:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1253 transitions. [2024-11-07 06:50:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 06:50:36,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:36,328 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:50:36,347 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:50:36,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:36,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:36,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1993180411, now seen corresponding path program 1 times [2024-11-07 06:50:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792390863] [2024-11-07 06:50:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:37,375 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:50:37,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:37,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792390863] [2024-11-07 06:50:37,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792390863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:37,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:37,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 06:50:37,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635086733] [2024-11-07 06:50:37,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:37,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 06:50:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:37,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 06:50:37,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:50:37,378 INFO L87 Difference]: Start difference. First operand 853 states and 1253 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:50:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:38,570 INFO L93 Difference]: Finished difference Result 1511 states and 2221 transitions. [2024-11-07 06:50:38,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:50:38,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 217 [2024-11-07 06:50:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:38,580 INFO L225 Difference]: With dead ends: 1511 [2024-11-07 06:50:38,580 INFO L226 Difference]: Without dead ends: 885 [2024-11-07 06:50:38,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-07 06:50:38,583 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 258 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:38,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 870 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 06:50:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-07 06:50:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 857. [2024-11-07 06:50:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 671 states have (on average 1.3785394932935917) internal successors, (925), 678 states have internal predecessors, (925), 165 states have call successors, (165), 20 states have call predecessors, (165), 20 states have return successors, (165), 158 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-07 06:50:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1255 transitions. [2024-11-07 06:50:38,662 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1255 transitions. Word has length 217 [2024-11-07 06:50:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:38,662 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1255 transitions. [2024-11-07 06:50:38,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:50:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1255 transitions. [2024-11-07 06:50:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 06:50:38,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:38,665 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:50:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 06:50:38,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash 632079637, now seen corresponding path program 1 times [2024-11-07 06:50:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372100538] [2024-11-07 06:50:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:50:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:50:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:50:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:50:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:50:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:50:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:50:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:50:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:50:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:50:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:50:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:50:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 06:50:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:50:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 06:50:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:50:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 06:50:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:50:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 06:50:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:50:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:50:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 06:50:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:50:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 06:50:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:50:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 06:50:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 06:50:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 06:50:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 06:50:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 06:50:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 06:50:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 06:50:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 06:50:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:50:40,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:50:40,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372100538] [2024-11-07 06:50:40,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372100538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:50:40,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305619614] [2024-11-07 06:50:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:40,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:40,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:40,976 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:50:40,978 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:50:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:41,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 06:50:41,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 57 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2024-11-07 06:50:41,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:50:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:50:42,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305619614] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:50:42,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:50:42,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 26 [2024-11-07 06:50:42,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169231613] [2024-11-07 06:50:42,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:50:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 06:50:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:50:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 06:50:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-11-07 06:50:42,844 INFO L87 Difference]: Start difference. First operand 857 states and 1255 transitions. Second operand has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 8 states have call successors, (99), 3 states have call predecessors, (99), 7 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) [2024-11-07 06:50:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:47,539 INFO L93 Difference]: Finished difference Result 3053 states and 4513 transitions. [2024-11-07 06:50:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-07 06:50:47,540 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 8 states have call successors, (99), 3 states have call predecessors, (99), 7 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) Word has length 218 [2024-11-07 06:50:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:47,554 INFO L225 Difference]: With dead ends: 3053 [2024-11-07 06:50:47,554 INFO L226 Difference]: Without dead ends: 2321 [2024-11-07 06:50:47,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=776, Invalid=3256, Unknown=0, NotChecked=0, Total=4032 [2024-11-07 06:50:47,560 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1970 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 3767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:50:47,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 1788 Invalid, 3767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 06:50:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2024-11-07 06:50:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 1081. [2024-11-07 06:50:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 841 states have (on average 1.3947681331747919) internal successors, (1173), 850 states have internal predecessors, (1173), 214 states have call successors, (214), 25 states have call predecessors, (214), 25 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-07 06:50:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1601 transitions. [2024-11-07 06:50:47,680 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1601 transitions. Word has length 218 [2024-11-07 06:50:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:47,680 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1601 transitions. [2024-11-07 06:50:47,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 8 states have call successors, (99), 3 states have call predecessors, (99), 7 states have return successors, (99), 8 states have call predecessors, (99), 8 states have call successors, (99) [2024-11-07 06:50:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1601 transitions. [2024-11-07 06:50:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-07 06:50:47,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:47,685 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, 1, 1] [2024-11-07 06:50:47,705 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:50:47,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:47,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:47,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1148146719, now seen corresponding path program 1 times [2024-11-07 06:50:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:50:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100066788] [2024-11-07 06:50:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:50:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:50:47,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935172846] [2024-11-07 06:50:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:47,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:50:47,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:47,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:50:47,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 06:50:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:50:48,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:50:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:50:48,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:50:48,439 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:50:48,440 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:50:48,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 06:50:48,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 06:50:48,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:50:48,820 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:50:48,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:50:48 BoogieIcfgContainer [2024-11-07 06:50:48,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:50:48,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:50:48,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:50:48,828 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:50:48,829 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:20" (3/4) ... [2024-11-07 06:50:48,831 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:50:48,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:50:48,834 INFO L158 Benchmark]: Toolchain (without parser) took 29922.50ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 90.9MB in the beginning and 170.1MB in the end (delta: -79.2MB). Peak memory consumption was 252.1MB. Max. memory is 16.1GB. [2024-11-07 06:50:48,834 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:50:48,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.81ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 75.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:50:48,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 72.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:50:48,835 INFO L158 Benchmark]: Boogie Preprocessor took 51.79ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 68.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:50:48,837 INFO L158 Benchmark]: RCFGBuilder took 642.86ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 85.0MB in the end (delta: -16.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-07 06:50:48,837 INFO L158 Benchmark]: TraceAbstraction took 28800.48ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 84.6MB in the beginning and 170.2MB in the end (delta: -85.7MB). Peak memory consumption was 238.8MB. Max. memory is 16.1GB. [2024-11-07 06:50:48,837 INFO L158 Benchmark]: Witness Printer took 6.85ms. Allocated memory is still 444.6MB. Free memory was 170.2MB in the beginning and 170.1MB in the end (delta: 108.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:50:48,839 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.81ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 75.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 72.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.79ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 68.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 642.86ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 85.0MB in the end (delta: -16.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28800.48ms. Allocated memory was 117.4MB in the beginning and 444.6MB in the end (delta: 327.2MB). Free memory was 84.6MB in the beginning and 170.2MB in the end (delta: -85.7MB). Peak memory consumption was 238.8MB. Max. memory is 16.1GB. * Witness Printer took 6.85ms. Allocated memory is still 444.6MB. Free memory was 170.2MB in the beginning and 170.1MB in the end (delta: 108.7kB). 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 someBinaryDOUBLEComparisonOperation at line 202, overapproximation of bitwiseOr at line 66, overapproximation of someBinaryArithmeticDOUBLEoperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_28 = 0; [L42] unsigned char var_1_29 = 0; [L43] unsigned char var_1_30 = 1; [L44] unsigned long int var_1_31 = 200; [L45] unsigned char var_1_35 = 32; [L46] unsigned char var_1_36 = 10; [L47] double var_1_37 = 15.5; [L48] signed long int var_1_39 = -10; [L49] unsigned long int var_1_42 = 10000; [L50] unsigned long int var_1_43 = 4251471014; [L51] signed short int var_1_44 = 64; [L52] unsigned char var_1_45 = 1; [L53] unsigned long int var_1_46 = 25; [L54] signed long int var_1_47 = -50; [L55] unsigned char var_1_48 = 0; [L56] double var_1_49 = 16.5; [L57] signed char last_1_var_1_8 = -10; [L58] signed short int last_1_var_1_21 = -50; [L59] unsigned char last_1_var_1_23 = 1; VAL [isInitial=0, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L197] last_1_var_1_8 = var_1_8 [L198] last_1_var_1_21 = var_1_21 [L199] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_4=21/2, var_1_5=31/20, var_1_8=-10] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L145] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L146] var_1_5 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L147] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L148] var_1_10 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L149] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L151] var_1_11 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L152] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L154] var_1_12 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L155] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L158] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L159] var_1_15 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L160] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L161] var_1_17 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L162] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L167] var_1_19 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L168] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L170] var_1_20 = __VERIFIER_nondet_ulong() [L171] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L171] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L173] var_1_24 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L174] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L177] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L179] var_1_29 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L180] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L182] var_1_30 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L183] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L188] var_1_43 = __VERIFIER_nondet_ulong() [L189] CALL assume_abort_if_not(var_1_43 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L189] RET assume_abort_if_not(var_1_43 >= 3221225470) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] CALL assume_abort_if_not(var_1_43 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] RET assume_abort_if_not(var_1_43 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L191] var_1_45 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L192] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] CALL assume_abort_if_not(var_1_45 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] RET assume_abort_if_not(var_1_45 <= 255) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] CALL assume_abort_if_not(var_1_45 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] RET assume_abort_if_not(var_1_45 != 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L210] RET updateVariables() [L211] CALL step() [L63] COND FALSE !(32 >= var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] EXPR (((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] COND FALSE !(var_1_19 > (((((16u | var_1_8)) > (var_1_18)) ? ((16u | var_1_8)) : (var_1_18)))) [L71] EXPR var_1_17 & -10 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L71] COND FALSE !((var_1_17 & -10) < var_1_19) [L80] var_1_37 = var_1_5 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L81] COND FALSE !(! var_1_30) [L84] var_1_39 = (var_1_16 + ((((var_1_36) > ((var_1_8 + var_1_12))) ? (var_1_36) : ((var_1_8 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L86] var_1_42 = ((var_1_43 - var_1_36) - var_1_21) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=64, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L87] COND TRUE (var_1_18 / var_1_45) > ((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36))) [L88] var_1_44 = ((((var_1_45) < ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) ? (var_1_45) : ((((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=2, var_1_8=-10] [L92] var_1_46 = var_1_43 [L93] var_1_47 = var_1_8 [L94] var_1_48 = var_1_30 [L95] var_1_49 = var_1_15 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L96] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-10] [L97] COND TRUE \read(last_1_var_1_23) [L98] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L103] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L104] COND FALSE !(128u >= var_1_8) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L111] COND FALSE !(\read(var_1_23)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=0, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L115] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L116] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L124] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L133] unsigned char stepLocal_1 = var_1_23; [L134] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=-1, stepLocal_1=0, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L135] COND TRUE stepLocal_0 >= var_1_16 [L136] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L211] RET step() [L212] CALL, EXPR property() [L202] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L202-L203] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=15, var_1_11=5, var_1_12=10, var_1_13=2571/20, var_1_15=3, var_1_16=4294967296, var_1_17=0, var_1_18=1329162250, var_1_19=4294967296, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=0, var_1_37=2, var_1_39=0, var_1_42=3221225520, var_1_43=3221225470, var_1_44=10, var_1_45=255, var_1_46=3221225470, var_1_47=-10, var_1_48=1, var_1_49=3, var_1_5=2, var_1_8=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.6s, OverallIterations: 13, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5303 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5208 mSDsluCounter, 7947 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5677 mSDsCounter, 1657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7026 IncrementalHoareTripleChecker+Invalid, 8683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1657 mSolverCounterUnsat, 2270 mSDtfsCounter, 7026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2261 GetRequests, 2108 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1556occurred in iteration=4, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 3679 NumberOfCodeBlocks, 3679 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3873 ConstructedInterpolants, 0 QuantifiedInterpolants, 18373 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1499 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 37629/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:50:48,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.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 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:50:51,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:50:51,303 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:50:51,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:50:51,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:50:51,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:50:51,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:50:51,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:50:51,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:50:51,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:50:51,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:50:51,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:50:51,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:50:51,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:50:51,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:50:51,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:50:51,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:50:51,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:50:51,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:50:51,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:50:51,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:50:51,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:50:51,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:50:51,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:50:51,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:50:51,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:50:51,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:50:51,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:50:51,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:50:51,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:50:51,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:50:51,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:50:51,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:50:51,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:50:51,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:51,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:50:51,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:50:51,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:50:51,358 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:50:51,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:50:51,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:50:51,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:50:51,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:50:51,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:50:51,359 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 -> 2ed23d94a5510a02522217ac25d44c0be6f4c30553346d9a869cec0689948ba9 [2024-11-07 06:50:51,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:50:51,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:50:51,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:50:51,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:50:51,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:50:51,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-07 06:50:53,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:50:53,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:50:53,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-07 06:50:53,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4285b8c/855f9f2fafd54b7dac940c97d04950d5/FLAGa5ba0ca7c [2024-11-07 06:50:53,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e4285b8c/855f9f2fafd54b7dac940c97d04950d5 [2024-11-07 06:50:53,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:50:53,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:50:53,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:53,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:50:53,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:50:53,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634bb814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53, skipping insertion in model container [2024-11-07 06:50:53,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:50:53,588 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-07 06:50:53,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:53,710 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:50:53,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i[919,932] [2024-11-07 06:50:53,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:50:53,807 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:50:53,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53 WrapperNode [2024-11-07 06:50:53,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:50:53,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:53,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:50:53,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:50:53,819 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:50:53" (1/1) ... [2024-11-07 06:50:53,836 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:50:53" (1/1) ... [2024-11-07 06:50:53,873 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-07 06:50:53,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:50:53,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:50:53,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:50:53,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:50:53,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,924 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:50:53,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:50:53,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:50:53,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:50:53,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:50:53,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (1/1) ... [2024-11-07 06:50:53,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:50:53,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:50:54,011 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:50:54,019 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:50:54,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:50:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:50:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:50:54,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:50:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:50:54,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:50:54,136 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:50:54,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:50:57,743 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:50:57,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:50:57,755 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:50:57,755 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:50:57,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:57 BoogieIcfgContainer [2024-11-07 06:50:57,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:50:57,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:50:57,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:50:57,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:50:57,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:50:53" (1/3) ... [2024-11-07 06:50:57,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62232854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:57, skipping insertion in model container [2024-11-07 06:50:57,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:53" (2/3) ... [2024-11-07 06:50:57,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62232854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:57, skipping insertion in model container [2024-11-07 06:50:57,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:57" (3/3) ... [2024-11-07 06:50:57,771 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-24.i [2024-11-07 06:50:57,788 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:50:57,789 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:50:57,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:50:57,873 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;@5350bf32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:50:57,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:50:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 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:50:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:50:57,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:57,895 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] [2024-11-07 06:50:57,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:57,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1816007015, now seen corresponding path program 1 times [2024-11-07 06:50:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:57,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279872401] [2024-11-07 06:50:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:57,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:50:57,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:57,915 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:50:57,917 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:50:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:58,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:50:58,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-07 06:50:58,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:50:58,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:50:58,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279872401] [2024-11-07 06:50:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279872401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:50:58,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:50:58,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:50:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382433229] [2024-11-07 06:50:58,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:50:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:50:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:50:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:50:58,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:50:58,496 INFO L87 Difference]: Start difference. First operand has 96 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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:50:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:50:58,539 INFO L93 Difference]: Finished difference Result 184 states and 329 transitions. [2024-11-07 06:50:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:50:58,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 208 [2024-11-07 06:50:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:50:58,547 INFO L225 Difference]: With dead ends: 184 [2024-11-07 06:50:58,548 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 06:50:58,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 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:50:58,558 INFO L432 NwaCegarLoop]: 142 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, 142 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:50:58,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:50:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 06:50:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 06:50:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 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:50:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-07 06:50:58,626 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 208 [2024-11-07 06:50:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:50:58,626 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-07 06:50:58,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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:50:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-07 06:50:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:50:58,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:50:58,633 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] [2024-11-07 06:50:58,647 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:50:58,833 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:50:58,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:50:58,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:50:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1638122025, now seen corresponding path program 1 times [2024-11-07 06:50:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:50:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982964027] [2024-11-07 06:50:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:50:58,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:50:58,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:50:58,838 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:50:58,841 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:50:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:50:59,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:50:59,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:50:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 848 proven. 24 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-11-07 06:50:59,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:51:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:51:00,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:51:00,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982964027] [2024-11-07 06:51:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982964027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:51:00,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:51:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:51:00,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034369657] [2024-11-07 06:51:00,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:51:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:51:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:51:00,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:51:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:51:00,872 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 06:51:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:51:01,971 INFO L93 Difference]: Finished difference Result 185 states and 286 transitions. [2024-11-07 06:51:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:51:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 208 [2024-11-07 06:51:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:51:01,975 INFO L225 Difference]: With dead ends: 185 [2024-11-07 06:51:01,975 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 06:51:01,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:51:01,977 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 87 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:51:01,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 244 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 06:51:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 06:51:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-07 06:51:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 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:51:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 144 transitions. [2024-11-07 06:51:02,004 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 144 transitions. Word has length 208 [2024-11-07 06:51:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:51:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 144 transitions. [2024-11-07 06:51:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-07 06:51:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 144 transitions. [2024-11-07 06:51:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 06:51:02,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:51:02,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] [2024-11-07 06:51:02,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:51:02,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:51:02,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:51:02,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:51:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1635776917, now seen corresponding path program 1 times [2024-11-07 06:51:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:51:02,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183345888] [2024-11-07 06:51:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:51:02,211 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:51:02,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:51:02,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:51:02,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:51:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:51:02,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:51:02,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:51:05,951 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:51:05,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:51:05,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:51:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183345888] [2024-11-07 06:51:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183345888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:51:05,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:51:05,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:51:05,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037010550] [2024-11-07 06:51:05,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:51:05,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:51:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:51:05,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:51:05,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:51:05,956 INFO L87 Difference]: Start difference. First operand 95 states and 144 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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:51:08,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:11,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:51:11,095 INFO L93 Difference]: Finished difference Result 297 states and 453 transitions. [2024-11-07 06:51:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:51:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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 208 [2024-11-07 06:51:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:51:11,123 INFO L225 Difference]: With dead ends: 297 [2024-11-07 06:51:11,124 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 06:51:11,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:51:11,125 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:51:11,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 398 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-07 06:51:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 06:51:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 184. [2024-11-07 06:51:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:51:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2024-11-07 06:51:11,173 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 208 [2024-11-07 06:51:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:51:11,174 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2024-11-07 06:51:11,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (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:51:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2024-11-07 06:51:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:51:11,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:51:11,181 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] [2024-11-07 06:51:11,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:51:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:51:11,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:51:11,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:51:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1002039159, now seen corresponding path program 1 times [2024-11-07 06:51:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:51:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27449171] [2024-11-07 06:51:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:51:11,383 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:51:11,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:51:11,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:51:11,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:51:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:51:11,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:51:11,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:51:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-07 06:51:12,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:51:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 57 proven. 39 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-07 06:51:12,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:51:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27449171] [2024-11-07 06:51:12,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27449171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:51:12,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:51:12,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 06:51:12,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333786761] [2024-11-07 06:51:12,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:51:12,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:51:12,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:51:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:51:12,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:51:12,807 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-07 06:51:15,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:51:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:51:16,480 INFO L93 Difference]: Finished difference Result 465 states and 692 transitions. [2024-11-07 06:51:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 06:51:16,480 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), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 209 [2024-11-07 06:51:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:51:16,484 INFO L225 Difference]: With dead ends: 465 [2024-11-07 06:51:16,484 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 06:51:16,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-07 06:51:16,486 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 145 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:51:16,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 444 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 06:51:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 06:51:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 192. [2024-11-07 06:51:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 119 states have (on average 1.2521008403361344) internal successors, (149), 119 states have internal predecessors, (149), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:51:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2024-11-07 06:51:16,523 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 209 [2024-11-07 06:51:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:51:16,523 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2024-11-07 06:51:16,524 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), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-07 06:51:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2024-11-07 06:51:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 06:51:16,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:51:16,532 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] [2024-11-07 06:51:16,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 06:51:16,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:51:16,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:51:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:51:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1682097529, now seen corresponding path program 1 times [2024-11-07 06:51:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:51:16,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342018759] [2024-11-07 06:51:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:51:16,735 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:51:16,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:51:16,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:51:16,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:51:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:51:17,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 06:51:17,069 INFO L278 TraceCheckSpWp]: Computing forward predicates...