./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-80.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-80.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', 'f7d166ae6b638088606bec3f58e23df2586db03d75893838c05e66dff30e4b76'] 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-80.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 f7d166ae6b638088606bec3f58e23df2586db03d75893838c05e66dff30e4b76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:57:16,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:57:16,651 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:57:16,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:57:16,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:57:16,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:57:16,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:57:16,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:57:16,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:57:16,683 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:57:16,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:57:16,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:57:16,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:57:16,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:57:16,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:57:16,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:57:16,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:57:16,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:57:16,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:57:16,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:57:16,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:57:16,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:57:16,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:57:16,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:16,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:57:16,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:57:16,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:57:16,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:57:16,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:57:16,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:57:16,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:57:16,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:57:16,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:57:16,688 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 -> f7d166ae6b638088606bec3f58e23df2586db03d75893838c05e66dff30e4b76 [2024-11-07 06:57:16,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:57:16,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:57:16,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:57:16,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:57:16,954 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:57:16,956 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-80.i [2024-11-07 06:57:18,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:57:18,273 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:57:18,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-80.i [2024-11-07 06:57:18,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/247877a8a/e50878a20bcc425481ca7d92d6b2e375/FLAGff64b2713 [2024-11-07 06:57:18,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/247877a8a/e50878a20bcc425481ca7d92d6b2e375 [2024-11-07 06:57:18,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:57:18,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:57:18,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:18,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:57:18,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:57:18,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebc7b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18, skipping insertion in model container [2024-11-07 06:57:18,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:57:18,741 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-80.i[919,932] [2024-11-07 06:57:18,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:18,800 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:57:18,812 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-80.i[919,932] [2024-11-07 06:57:18,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:18,860 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:57:18,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18 WrapperNode [2024-11-07 06:57:18,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:18,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:18,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:57:18,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:57:18,865 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:57:18" (1/1) ... [2024-11-07 06:57:18,873 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:57:18" (1/1) ... [2024-11-07 06:57:18,908 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-11-07 06:57:18,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:18,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:57:18,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:57:18,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:57:18,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,948 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:57:18,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:57:18,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:57:18,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:57:18,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:57:18,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (1/1) ... [2024-11-07 06:57:18,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:18,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:57:19,010 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:57:19,012 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:57:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:57:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:57:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:57:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:57:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:57:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:57:19,093 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:57:19,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:57:19,449 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:57:19,449 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:57:19,458 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:57:19,460 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:57:19,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:19 BoogieIcfgContainer [2024-11-07 06:57:19,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:57:19,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:57:19,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:57:19,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:57:19,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:57:18" (1/3) ... [2024-11-07 06:57:19,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1010d2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:19, skipping insertion in model container [2024-11-07 06:57:19,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:18" (2/3) ... [2024-11-07 06:57:19,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1010d2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:19, skipping insertion in model container [2024-11-07 06:57:19,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:19" (3/3) ... [2024-11-07 06:57:19,466 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-80.i [2024-11-07 06:57:19,477 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:57:19,477 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:57:19,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:57:19,533 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;@7df893c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:57:19,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:57:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:57:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:57:19,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:19,549 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:19,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:19,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -755665703, now seen corresponding path program 1 times [2024-11-07 06:57:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950518923] [2024-11-07 06:57:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:57:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:19,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950518923] [2024-11-07 06:57:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950518923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:19,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:19,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:57:19,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233496551] [2024-11-07 06:57:19,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:19,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:57:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:19,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:57:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:57:19,903 INFO L87 Difference]: Start difference. First operand has 96 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:57:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:19,924 INFO L93 Difference]: Finished difference Result 185 states and 323 transitions. [2024-11-07 06:57:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:57:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2024-11-07 06:57:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:19,929 INFO L225 Difference]: With dead ends: 185 [2024-11-07 06:57:19,929 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 06:57:19,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:57:19,933 INFO L432 NwaCegarLoop]: 143 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, 143 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:19,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 06:57:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 06:57:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:57:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2024-11-07 06:57:19,985 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 143 transitions. Word has length 191 [2024-11-07 06:57:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:19,986 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 143 transitions. [2024-11-07 06:57:19,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:57:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 143 transitions. [2024-11-07 06:57:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:57:19,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:19,988 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:19,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:57:19,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:19,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash -745747245, now seen corresponding path program 1 times [2024-11-07 06:57:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:19,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820705287] [2024-11-07 06:57:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:57:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820705287] [2024-11-07 06:57:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820705287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:57:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722732396] [2024-11-07 06:57:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:20,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:20,316 INFO L87 Difference]: Start difference. First operand 92 states and 143 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:20,352 INFO L93 Difference]: Finished difference Result 182 states and 285 transitions. [2024-11-07 06:57:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 06:57:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:20,354 INFO L225 Difference]: With dead ends: 182 [2024-11-07 06:57:20,354 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 06:57:20,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:57:20,355 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:20,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 06:57:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 06:57:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:57:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2024-11-07 06:57:20,373 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 191 [2024-11-07 06:57:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:20,374 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2024-11-07 06:57:20,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2024-11-07 06:57:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:57:20,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:20,377 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:20,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:57:20,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:20,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1168449071, now seen corresponding path program 1 times [2024-11-07 06:57:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:20,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837741683] [2024-11-07 06:57:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:57:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837741683] [2024-11-07 06:57:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837741683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:20,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:57:20,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444471229] [2024-11-07 06:57:20,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:20,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:20,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:20,911 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:20,979 INFO L93 Difference]: Finished difference Result 273 states and 426 transitions. [2024-11-07 06:57:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 06:57:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:20,983 INFO L225 Difference]: With dead ends: 273 [2024-11-07 06:57:20,983 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 06:57:20,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:57:20,984 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 81 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 278 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:57:20,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 278 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 06:57:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-07 06:57:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 06:57:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 279 transitions. [2024-11-07 06:57:21,021 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 279 transitions. Word has length 191 [2024-11-07 06:57:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:21,022 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 279 transitions. [2024-11-07 06:57:21,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 279 transitions. [2024-11-07 06:57:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:57:21,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:21,024 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:57:21,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1830601493, now seen corresponding path program 1 times [2024-11-07 06:57:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794823848] [2024-11-07 06:57:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:57:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794823848] [2024-11-07 06:57:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794823848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:21,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:21,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:57:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259523774] [2024-11-07 06:57:21,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:21,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:57:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:57:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:57:21,235 INFO L87 Difference]: Start difference. First operand 181 states and 279 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:21,315 INFO L93 Difference]: Finished difference Result 449 states and 696 transitions. [2024-11-07 06:57:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:57:21,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 06:57:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:21,319 INFO L225 Difference]: With dead ends: 449 [2024-11-07 06:57:21,321 INFO L226 Difference]: Without dead ends: 359 [2024-11-07 06:57:21,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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:57:21,324 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 139 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:21,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 440 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-07 06:57:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 185. [2024-11-07 06:57:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 06:57:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 283 transitions. [2024-11-07 06:57:21,358 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 283 transitions. Word has length 191 [2024-11-07 06:57:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:21,360 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 283 transitions. [2024-11-07 06:57:21,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 283 transitions. [2024-11-07 06:57:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 06:57:21,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:21,364 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:21,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:57:21,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:21,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2088766931, now seen corresponding path program 1 times [2024-11-07 06:57:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639652478] [2024-11-07 06:57:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:57:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639652478] [2024-11-07 06:57:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639652478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:21,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:21,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:57:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431072725] [2024-11-07 06:57:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:21,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:21,513 INFO L87 Difference]: Start difference. First operand 185 states and 283 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:21,539 INFO L93 Difference]: Finished difference Result 275 states and 418 transitions. [2024-11-07 06:57:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:21,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-07 06:57:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:21,541 INFO L225 Difference]: With dead ends: 275 [2024-11-07 06:57:21,541 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 06:57:21,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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:57:21,542 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:21,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:57:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 06:57:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 06:57:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:57:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-07 06:57:21,558 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 191 [2024-11-07 06:57:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:21,559 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-07 06:57:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-07 06:57:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 06:57:21,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:21,561 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:21,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:57:21,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1928380048, now seen corresponding path program 1 times [2024-11-07 06:57:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184211503] [2024-11-07 06:57:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:57:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184211503] [2024-11-07 06:57:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184211503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447513021] [2024-11-07 06:57:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:57:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:57:21,859 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:57:21,861 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:57:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:21,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:57:22,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-07 06:57:22,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:57:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447513021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:57:22,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:57:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 06:57:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699650432] [2024-11-07 06:57:22,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:57:22,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:57:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:22,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:57:22,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:57:22,289 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-07 06:57:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:22,494 INFO L93 Difference]: Finished difference Result 189 states and 276 transitions. [2024-11-07 06:57:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:57:22,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 193 [2024-11-07 06:57:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:22,496 INFO L225 Difference]: With dead ends: 189 [2024-11-07 06:57:22,496 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 06:57:22,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:57:22,497 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 154 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:22,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 241 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:57:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 06:57:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-07 06:57:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 65 states have internal predecessors, (81), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:57:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-07 06:57:22,508 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 193 [2024-11-07 06:57:22,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:22,508 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-07 06:57:22,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-07 06:57:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-07 06:57:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 06:57:22,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:22,509 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:22,524 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:57:22,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:57:22,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:22,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash 411273445, now seen corresponding path program 1 times [2024-11-07 06:57:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090282238] [2024-11-07 06:57:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:57:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:22,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090282238] [2024-11-07 06:57:22,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090282238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:57:22,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:57:22,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:57:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521334123] [2024-11-07 06:57:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:57:22,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:57:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:22,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:57:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:57:22,946 INFO L87 Difference]: Start difference. First operand 97 states and 139 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:23,030 INFO L93 Difference]: Finished difference Result 285 states and 411 transitions. [2024-11-07 06:57:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:57:23,030 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-07 06:57:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:23,032 INFO L225 Difference]: With dead ends: 285 [2024-11-07 06:57:23,032 INFO L226 Difference]: Without dead ends: 191 [2024-11-07 06:57:23,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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:57:23,032 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 75 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:23,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 234 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:57:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-07 06:57:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-11-07 06:57:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.246031746031746) internal successors, (157), 126 states have internal predecessors, (157), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 06:57:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2024-11-07 06:57:23,078 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 194 [2024-11-07 06:57:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:23,079 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2024-11-07 06:57:23,079 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:57:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2024-11-07 06:57:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-07 06:57:23,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:23,080 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:23,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:57:23,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash -600863667, now seen corresponding path program 1 times [2024-11-07 06:57:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543975519] [2024-11-07 06:57:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:57:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:57:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:57:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 06:57:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 06:57:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:57:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 06:57:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:57:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 06:57:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:57:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 06:57:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 06:57:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 06:57:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 06:57:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 06:57:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 06:57:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 06:57:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 06:57:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 06:57:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 06:57:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 06:57:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:57:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 06:57:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:57:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 06:57:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 06:57:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 06:57:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 06:57:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 06:57:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:57:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:57:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543975519] [2024-11-07 06:57:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543975519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:57:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827520807] [2024-11-07 06:57:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:23,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:57:23,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:57:23,337 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:57:23,338 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:57:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:57:23,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:57:23,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:57:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-07 06:57:23,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:57:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-07 06:57:23,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827520807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:57:23,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:57:23,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 06:57:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895990942] [2024-11-07 06:57:23,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:57:23,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:57:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:57:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:57:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:57:23,709 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-07 06:57:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:57:23,908 INFO L93 Difference]: Finished difference Result 379 states and 547 transitions. [2024-11-07 06:57:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:57:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 195 [2024-11-07 06:57:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:57:23,910 INFO L225 Difference]: With dead ends: 379 [2024-11-07 06:57:23,910 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 06:57:23,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-07 06:57:23,911 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 148 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:57:23,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 329 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:57:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 06:57:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2024-11-07 06:57:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 126 states have internal predecessors, (155), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 06:57:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2024-11-07 06:57:23,941 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 195 [2024-11-07 06:57:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:57:23,941 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2024-11-07 06:57:23,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-07 06:57:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2024-11-07 06:57:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-07 06:57:23,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:23,943 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:23,956 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:57:24,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:57:24,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 179409621, now seen corresponding path program 1 times [2024-11-07 06:57:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:57:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690384615] [2024-11-07 06:57:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:57:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:57:24,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:57:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:57:24,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:57:24,374 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:57:24,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:57:24,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 06:57:24,377 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:24,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:57:24,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:57:24 BoogieIcfgContainer [2024-11-07 06:57:24,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:57:24,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:57:24,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:57:24,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:57:24,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:19" (3/4) ... [2024-11-07 06:57:24,487 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:57:24,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:57:24,488 INFO L158 Benchmark]: Toolchain (without parser) took 5865.97ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 85.2MB in the beginning and 48.7MB in the end (delta: 36.5MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2024-11-07 06:57:24,489 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:57:24,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.12ms. Allocated memory is still 109.1MB. Free memory was 85.0MB in the beginning and 69.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:57:24,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.39ms. Allocated memory is still 109.1MB. Free memory was 69.5MB in the beginning and 64.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:57:24,490 INFO L158 Benchmark]: Boogie Preprocessor took 73.28ms. Allocated memory is still 109.1MB. Free memory was 64.8MB in the beginning and 57.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:57:24,490 INFO L158 Benchmark]: RCFGBuilder took 476.29ms. Allocated memory is still 109.1MB. Free memory was 57.6MB in the beginning and 75.1MB in the end (delta: -17.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-07 06:57:24,490 INFO L158 Benchmark]: TraceAbstraction took 5023.00ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 74.6MB in the beginning and 48.7MB in the end (delta: 25.8MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-11-07 06:57:24,490 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:57:24,491 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.12ms. Allocated memory is still 109.1MB. Free memory was 85.0MB in the beginning and 69.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.39ms. Allocated memory is still 109.1MB. Free memory was 69.5MB in the beginning and 64.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.28ms. Allocated memory is still 109.1MB. Free memory was 64.8MB in the beginning and 57.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 476.29ms. Allocated memory is still 109.1MB. Free memory was 57.6MB in the beginning and 75.1MB in the end (delta: -17.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5023.00ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 74.6MB in the beginning and 48.7MB in the end (delta: 25.8MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of bitwiseOr at line 65, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] double var_1_28 = 9.25; [L44] double var_1_29 = 0.0; [L45] double var_1_30 = 127.6; [L46] unsigned long int var_1_32 = 128; [L47] unsigned long int var_1_34 = 1089279310; [L48] unsigned long int var_1_35 = 1307137784; [L49] unsigned long int var_1_36 = 1417807175; [L50] unsigned long int var_1_38 = 2; [L51] unsigned short int var_1_40 = 5; [L52] unsigned char var_1_44 = 5; [L53] unsigned char var_1_46 = 16; [L54] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L177] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L128] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] var_1_3 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L131] var_1_4 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L132] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L133] var_1_5 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L134] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L141] var_1_13 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L142] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L145] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L147] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L153] var_1_21 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L154] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L156] var_1_23 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L157] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L159] var_1_29 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L160] RET assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L161] var_1_30 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L162] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L163] var_1_34 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_34 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L164] RET assume_abort_if_not(var_1_34 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L166] var_1_35 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_35 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L167] RET assume_abort_if_not(var_1_35 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L169] var_1_36 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_36 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L170] RET assume_abort_if_not(var_1_36 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L172] var_1_46 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_46 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L173] RET assume_abort_if_not(var_1_46 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L174] CALL assume_abort_if_not(var_1_46 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L174] RET assume_abort_if_not(var_1_46 <= 127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L188] RET updateVariables() [L189] CALL step() [L58] EXPR var_1_10 & var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L58] COND TRUE (var_1_10 & var_1_12) >= -2 [L59] var_1_24 = var_1_16 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_28=37/4, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L61] var_1_28 = ((8.18603254193775E18 - (var_1_29 - var_1_30)) - var_1_16) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L62] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L65] EXPR var_1_35 | var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L65] COND TRUE (var_1_35 | var_1_10) > var_1_10 [L66] COND TRUE var_1_29 <= ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) [L67] var_1_38 = ((((var_1_18) < ((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) - var_1_36))) ? (var_1_18) : ((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) - var_1_36)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L76] COND FALSE !((((((var_1_30 * var_1_13)) < (var_1_29)) ? ((var_1_30 * var_1_13)) : (var_1_29))) >= (- var_1_16)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L83] EXPR var_1_10 & var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L83] COND TRUE -32 < (var_1_10 & var_1_12) [L84] var_1_44 = ((((var_1_12) < ((var_1_46 + 10))) ? (var_1_12) : ((var_1_46 + 10)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-25] [L88] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-25] [L89] COND TRUE stepLocal_0 >= last_1_var_1_10 [L90] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L94] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L95] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L98] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L101] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L102] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L105] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L106] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L110] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L113] COND FALSE !(\read(var_1_19)) [L116] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L118] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=0, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L119] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L120] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L189] RET step() [L190] CALL, EXPR property() [L180-L181] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=4294967040, var_1_11=0, var_1_12=4294967040, var_1_14=-128, var_1_16=10000000004, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=10000000004, var_1_32=128, var_1_34=2147483647, var_1_35=2147483647, var_1_36=2147483647, var_1_38=-2147483649, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 643 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 597 mSDsluCounter, 2208 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1159 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 471 IncrementalHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1049 mSDtfsCounter, 471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1304 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 184 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2121 NumberOfCodeBlocks, 2121 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3943 SizeOfPredicates, 6 NumberOfNonLiveVariables, 871 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 19398/19488 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:57:24,516 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-80.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 f7d166ae6b638088606bec3f58e23df2586db03d75893838c05e66dff30e4b76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:57:26,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:57:26,312 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:57:26,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:57:26,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:57:26,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:57:26,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:57:26,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:57:26,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:57:26,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:57:26,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:57:26,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:57:26,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:57:26,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:57:26,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:57:26,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:57:26,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:57:26,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:57:26,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:57:26,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:57:26,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:57:26,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:57:26,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:57:26,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:26,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:57:26,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:57:26,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:57:26,345 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 -> f7d166ae6b638088606bec3f58e23df2586db03d75893838c05e66dff30e4b76 [2024-11-07 06:57:26,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:57:26,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:57:26,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:57:26,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:57:26,580 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:57:26,581 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-80.i [2024-11-07 06:57:27,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:57:27,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:57:27,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-80.i [2024-11-07 06:57:27,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f122a9a4d/be08b8a9e5094c019bc76c064a504cc5/FLAG0c0df34ef [2024-11-07 06:57:27,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f122a9a4d/be08b8a9e5094c019bc76c064a504cc5 [2024-11-07 06:57:27,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:57:27,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:57:27,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:27,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:57:27,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:57:27,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:27" (1/1) ... [2024-11-07 06:57:27,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d00603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:27, skipping insertion in model container [2024-11-07 06:57:27,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:57:27" (1/1) ... [2024-11-07 06:57:27,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:57:28,071 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-80.i[919,932] [2024-11-07 06:57:28,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:28,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:57:28,138 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-80.i[919,932] [2024-11-07 06:57:28,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:57:28,178 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:57:28,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28 WrapperNode [2024-11-07 06:57:28,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:57:28,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:28,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:57:28,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:57:28,184 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:57:28" (1/1) ... [2024-11-07 06:57:28,196 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:57:28" (1/1) ... [2024-11-07 06:57:28,227 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-07 06:57:28,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:57:28,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:57:28,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:57:28,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:57:28,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,266 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:57:28,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:57:28,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:57:28,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:57:28,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:57:28,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (1/1) ... [2024-11-07 06:57:28,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:57:28,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:57:28,332 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:57:28,335 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:57:28,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:57:28,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:57:28,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:57:28,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:57:28,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:57:28,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:57:28,434 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:57:28,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:57:58,986 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:57:58,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:57:58,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:57:58,994 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:57:58,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:58 BoogieIcfgContainer [2024-11-07 06:57:58,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:57:58,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:57:58,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:57:59,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:57:59,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:57:27" (1/3) ... [2024-11-07 06:57:59,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20058090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:59, skipping insertion in model container [2024-11-07 06:57:59,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:57:28" (2/3) ... [2024-11-07 06:57:59,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20058090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:57:59, skipping insertion in model container [2024-11-07 06:57:59,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:57:58" (3/3) ... [2024-11-07 06:57:59,003 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-80.i [2024-11-07 06:57:59,013 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:57:59,013 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:57:59,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:57:59,063 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;@11a25299, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:57:59,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:57:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:57:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 06:57:59,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:57:59,077 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:57:59,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:57:59,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:57:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash 699990981, now seen corresponding path program 1 times [2024-11-07 06:57:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:57:59,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815064446] [2024-11-07 06:57:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:57:59,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:57:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:57:59,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:57:59,092 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:58:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:00,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:58:00,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-07 06:58:00,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:58:00,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815064446] [2024-11-07 06:58:00,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815064446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:00,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:00,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:58:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249212742] [2024-11-07 06:58:00,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:00,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:58:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:58:00,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:58:00,479 INFO L87 Difference]: Start difference. First operand has 87 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:58:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:00,497 INFO L93 Difference]: Finished difference Result 167 states and 293 transitions. [2024-11-07 06:58:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:58:00,499 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-11-07 06:58:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:00,503 INFO L225 Difference]: With dead ends: 167 [2024-11-07 06:58:00,503 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 06:58:00,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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:58:00,507 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:00,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:58:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 06:58:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-07 06:58:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 06:58:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2024-11-07 06:58:00,548 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 188 [2024-11-07 06:58:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:00,548 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2024-11-07 06:58:00,549 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-07 06:58:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2024-11-07 06:58:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 06:58:00,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:00,552 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:00,584 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:58:00,752 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:58:00,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:00,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:00,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1981858293, now seen corresponding path program 1 times [2024-11-07 06:58:00,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:00,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081470732] [2024-11-07 06:58:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:00,754 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:58:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:00,756 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:58:00,757 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:58:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:02,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:58:02,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:58:06,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:58:06,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081470732] [2024-11-07 06:58:06,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081470732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:06,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:58:06,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:58:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4158035] [2024-11-07 06:58:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:06,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:58:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:58:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:06,588 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:58:11,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:58:15,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:58:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:15,271 INFO L93 Difference]: Finished difference Result 241 states and 368 transitions. [2024-11-07 06:58:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:58:15,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-11-07 06:58:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:15,275 INFO L225 Difference]: With dead ends: 241 [2024-11-07 06:58:15,275 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 06:58:15,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:58:15,278 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 30 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:15,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 239 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-07 06:58:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 06:58:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-11-07 06:58:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 06:58:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 239 transitions. [2024-11-07 06:58:15,307 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 239 transitions. Word has length 188 [2024-11-07 06:58:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:15,308 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 239 transitions. [2024-11-07 06:58:15,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:58:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 239 transitions. [2024-11-07 06:58:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 06:58:15,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:15,310 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:15,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:58:15,510 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:58:15,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 724761101, now seen corresponding path program 1 times [2024-11-07 06:58:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437704821] [2024-11-07 06:58:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:15,512 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:58:15,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:15,514 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:58:15,515 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:58:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:16,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:58:16,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 541 proven. 24 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-07 06:58:19,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:58:19,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437704821] [2024-11-07 06:58:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437704821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:58:19,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1716886780] [2024-11-07 06:58:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:19,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:58:19,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:58:19,845 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:58:19,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 06:58:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:22,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 06:58:22,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:58:22,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:58:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1716886780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:22,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:58:22,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-07 06:58:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511971980] [2024-11-07 06:58:22,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:22,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:58:22,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:58:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:58:22,619 INFO L87 Difference]: Start difference. First operand 159 states and 239 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:58:27,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:58:31,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:58:35,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:58:39,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:58:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:58:39,588 INFO L93 Difference]: Finished difference Result 471 states and 711 transitions. [2024-11-07 06:58:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:58:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-11-07 06:58:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:58:39,592 INFO L225 Difference]: With dead ends: 471 [2024-11-07 06:58:39,592 INFO L226 Difference]: Without dead ends: 315 [2024-11-07 06:58:39,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:58:39,595 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 122 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:58:39,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 389 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2024-11-07 06:58:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-07 06:58:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 163. [2024-11-07 06:58:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 06:58:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2024-11-07 06:58:39,643 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 188 [2024-11-07 06:58:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:58:39,645 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2024-11-07 06:58:39,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:58:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2024-11-07 06:58:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 06:58:39,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:58:39,650 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:39,685 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:58:39,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-07 06:58:40,051 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,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 06:58:40,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:58:40,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:58:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash 982926539, now seen corresponding path program 1 times [2024-11-07 06:58:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:58:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809999481] [2024-11-07 06:58:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:40,052 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:58:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:58:40,055 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:58:40,056 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:58:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:41,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:58:41,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 541 proven. 24 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-07 06:58:43,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:58:44,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:58:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809999481] [2024-11-07 06:58:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809999481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:58:44,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [266649699] [2024-11-07 06:58:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:58:44,245 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:58:44,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:58:44,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 06:58:44,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 06:58:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:58:46,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:58:46,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:58:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 06:58:52,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:58:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [266649699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:58:52,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:58:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-07 06:58:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797307560] [2024-11-07 06:58:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:58:52,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:58:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:58:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:58:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:58:52,106 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-07 06:58:58,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []