./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-86.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_variablewrapping_normal_file-86.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', 'd0dfba50fbd72a6b5ad9816cf1aa0dae3c94bcfb94eabb013d8300ea77591d1e'] 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_variablewrapping_normal_file-86.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 d0dfba50fbd72a6b5ad9816cf1aa0dae3c94bcfb94eabb013d8300ea77591d1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:06:56,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:06:56,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:06:56,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:06:56,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:06:57,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:06:57,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:06:57,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:06:57,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:06:57,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:06:57,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:06:57,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:06:57,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:06:57,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:06:57,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:06:57,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:06:57,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:06:57,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:06:57,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:06:57,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:06:57,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:06:57,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:06:57,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:06:57,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:06:57,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:06:57,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:06:57,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:06:57,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:06:57,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:06:57,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:06:57,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:06:57,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:06:57,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:06:57,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:06:57,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:06:57,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:06:57,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:06:57,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:06:57,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:06:57,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:06:57,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:06:57,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:06:57,014 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 -> d0dfba50fbd72a6b5ad9816cf1aa0dae3c94bcfb94eabb013d8300ea77591d1e [2024-11-07 10:06:57,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:06:57,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:06:57,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:06:57,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:06:57,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:06:57,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-86.i [2024-11-07 10:06:58,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:06:58,943 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:06:58,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-86.i [2024-11-07 10:06:58,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a79ef11/da6e2ad0c8d6467eaa545d7cd55deabd/FLAGaa154949d [2024-11-07 10:06:58,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1a79ef11/da6e2ad0c8d6467eaa545d7cd55deabd [2024-11-07 10:06:58,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:06:58,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:06:58,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:06:58,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:06:58,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:06:58,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:06:58" (1/1) ... [2024-11-07 10:06:58,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768fe2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:58, skipping insertion in model container [2024-11-07 10:06:58,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:06:58" (1/1) ... [2024-11-07 10:06:59,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:06:59,145 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_variablewrapping_normal_file-86.i[913,926] [2024-11-07 10:06:59,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:06:59,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:06:59,257 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_variablewrapping_normal_file-86.i[913,926] [2024-11-07 10:06:59,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:06:59,319 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:06:59,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59 WrapperNode [2024-11-07 10:06:59,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:06:59,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:06:59,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:06:59,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:06:59,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,401 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-07 10:06:59,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:06:59,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:06:59,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:06:59,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:06:59,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,439 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 10:06:59,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:06:59,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:06:59,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:06:59,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:06:59,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (1/1) ... [2024-11-07 10:06:59,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:06:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:06:59,511 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 10:06:59,517 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 10:06:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:06:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:06:59,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:06:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:06:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:06:59,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:06:59,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:06:59,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:06:59,934 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 10:06:59,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:06:59,949 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:06:59,951 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:06:59,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:06:59 BoogieIcfgContainer [2024-11-07 10:06:59,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:06:59,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:06:59,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:06:59,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:06:59,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:06:58" (1/3) ... [2024-11-07 10:06:59,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0a77fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:06:59, skipping insertion in model container [2024-11-07 10:06:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:06:59" (2/3) ... [2024-11-07 10:06:59,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0a77fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:06:59, skipping insertion in model container [2024-11-07 10:06:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:06:59" (3/3) ... [2024-11-07 10:06:59,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-86.i [2024-11-07 10:06:59,981 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:06:59,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:07:00,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:07:00,053 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;@5d64a5c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:07:00,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:07:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 10:07:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:07:00,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:00,069 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:00,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:00,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2081904117, now seen corresponding path program 1 times [2024-11-07 10:07:00,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110888176] [2024-11-07 10:07:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:07:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:07:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:07:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:07:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:07:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:07:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:07:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:07:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:07:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:07:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:07:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 10:07:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:07:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:07:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:07:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:07:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:07:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:07:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:07:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 10:07:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:07:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:07:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 10:07:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 10:07:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 10:07:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 10:07:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:07:00,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110888176] [2024-11-07 10:07:00,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110888176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:00,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:00,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:07:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819562457] [2024-11-07 10:07:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:00,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:07:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:07:00,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:07:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:07:00,502 INFO L87 Difference]: Start difference. First operand has 73 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 10:07:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:00,529 INFO L93 Difference]: Finished difference Result 139 states and 235 transitions. [2024-11-07 10:07:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:07:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 155 [2024-11-07 10:07:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:00,539 INFO L225 Difference]: With dead ends: 139 [2024-11-07 10:07:00,539 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 10:07:00,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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 10:07:00,545 INFO L432 NwaCegarLoop]: 101 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, 101 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 10:07:00,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:07:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 10:07:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 10:07:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 10:07:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2024-11-07 10:07:00,584 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 155 [2024-11-07 10:07:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:00,584 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2024-11-07 10:07:00,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 10:07:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2024-11-07 10:07:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:07:00,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:00,588 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:00,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:07:00,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:00,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2077999, now seen corresponding path program 1 times [2024-11-07 10:07:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553974730] [2024-11-07 10:07:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:07:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:07:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:07:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:07:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:07:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:07:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:07:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:07:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:07:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:07:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:07:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 10:07:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 10:07:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 10:07:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:07:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:07:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 10:07:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 10:07:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 10:07:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 10:07:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:07:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:07:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 10:07:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 10:07:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 10:07:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 10:07:00,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:07:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553974730] [2024-11-07 10:07:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553974730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:00,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:07:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580669192] [2024-11-07 10:07:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:00,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:07:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:07:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:07:00,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:07:00,983 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 10:07:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:01,041 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2024-11-07 10:07:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:07:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 155 [2024-11-07 10:07:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:01,045 INFO L225 Difference]: With dead ends: 157 [2024-11-07 10:07:01,045 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:07:01,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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 10:07:01,047 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 25 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:07:01,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 202 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:07:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:07:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2024-11-07 10:07:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 10:07:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-11-07 10:07:01,058 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 155 [2024-11-07 10:07:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:01,059 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-11-07 10:07:01,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 10:07:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-11-07 10:07:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:07:01,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:01,062 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:01,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:07:01,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:01,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash 698986579, now seen corresponding path program 1 times [2024-11-07 10:07:01,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:01,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382517790] [2024-11-07 10:07:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:07:01,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:07:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:07:01,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:07:01,315 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:07:01,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:07:01,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:07:01,320 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 10:07:01,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:07:01,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:07:01 BoogieIcfgContainer [2024-11-07 10:07:01,436 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:07:01,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:07:01,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:07:01,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:07:01,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:06:59" (3/4) ... [2024-11-07 10:07:01,441 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:07:01,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:07:01,443 INFO L158 Benchmark]: Toolchain (without parser) took 2463.13ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.8MB in the beginning and 126.0MB in the end (delta: -34.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-07 10:07:01,443 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:07:01,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.40ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 77.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:07:01,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.34ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 73.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:07:01,445 INFO L158 Benchmark]: Boogie Preprocessor took 71.11ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 65.1MB in the end (delta: 8.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:07:01,446 INFO L158 Benchmark]: RCFGBuilder took 477.38ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 88.2MB in the end (delta: -23.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-07 10:07:01,447 INFO L158 Benchmark]: TraceAbstraction took 1480.81ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 87.6MB in the beginning and 126.8MB in the end (delta: -39.2MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-11-07 10:07:01,447 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 159.4MB. Free memory was 126.8MB in the beginning and 126.0MB in the end (delta: 797.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:07:01,448 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.19ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.40ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 77.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.34ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 73.1MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.11ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 65.1MB in the end (delta: 8.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 477.38ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 88.2MB in the end (delta: -23.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1480.81ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 87.6MB in the beginning and 126.8MB in the end (delta: -39.2MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 159.4MB. Free memory was 126.8MB in the beginning and 126.0MB in the end (delta: 797.8kB). 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 107, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = 2; [L25] signed short int var_1_4 = 256; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 2; [L28] float var_1_7 = 255.8; [L29] float var_1_8 = 127.8; [L30] float var_1_9 = 128.5; [L31] float var_1_10 = 499.3; [L32] unsigned short int var_1_11 = 10; [L33] unsigned char var_1_12 = 1; [L34] unsigned short int var_1_13 = 8; [L35] unsigned short int var_1_14 = 256; [L36] unsigned short int var_1_15 = 1; [L37] unsigned short int var_1_16 = 16; [L38] unsigned short int var_1_17 = 57705; [L39] unsigned long int var_1_18 = 64; VAL [isInitial=0, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L68] RET assume_abort_if_not(var_1_3 >= -16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L69] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L70] var_1_4 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_4 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L71] RET assume_abort_if_not(var_1_4 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L72] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=-256, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L73] var_1_5 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_5 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L74] RET assume_abort_if_not(var_1_5 >= -8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] CALL assume_abort_if_not(var_1_5 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L75] RET assume_abort_if_not(var_1_5 <= 8191) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=2, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L76] var_1_6 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L77] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L78] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_8=639/5, var_1_9=257/2] [L79] var_1_8 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_9=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_9=257/2] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5, var_1_9=257/2] [L81] var_1_9 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L82] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4993/10, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L84] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L87] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L87] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L90] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L90] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L91] var_1_14 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L93] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L93] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L94] var_1_15 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L96] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L96] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L97] var_1_16 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L99] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L99] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L100] var_1_17 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L101] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L102] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L102] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L115] RET updateVariables() [L116] CALL step() [L43] COND FALSE !(! var_1_2) [L46] var_1_1 = var_1_5 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L48] signed short int stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=8191, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766, var_1_7=1279/5] [L49] COND TRUE stepLocal_0 > 2 [L50] var_1_7 = ((var_1_8 + var_1_9) - var_1_10) VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=64, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766] [L52] var_1_18 = var_1_17 VAL [isInitial=1, var_1_11=10, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766] [L53] COND TRUE var_1_2 && var_1_12 [L54] var_1_11 = (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))) VAL [isInitial=1, var_1_11=32767, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_11=32767, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766] [L107-L108] return ((((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((float) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))))) && (var_1_18 == ((unsigned long int) var_1_17)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=32767, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766] [L19] reach_error() VAL [isInitial=1, var_1_11=32767, var_1_12=1, var_1_13=0, var_1_14=32766, var_1_15=32767, var_1_16=32767, var_1_17=65534, var_1_18=65534, var_1_1=8191, var_1_2=1, var_1_3=16383, var_1_4=8192, var_1_5=8191, var_1_6=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 214 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2400/2400 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 10:07:01,477 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_variablewrapping_normal_file-86.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 d0dfba50fbd72a6b5ad9816cf1aa0dae3c94bcfb94eabb013d8300ea77591d1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:07:03,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:07:03,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:07:03,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:07:03,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:07:03,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:07:03,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:07:03,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:07:03,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:07:03,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:07:03,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:07:03,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:07:03,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:07:03,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:07:03,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:07:03,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:07:03,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:07:03,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:07:03,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:07:03,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:07:03,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:07:03,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:07:03,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:07:03,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:07:03,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:07:03,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:07:03,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:07:03,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:07:03,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:07:03,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:07:03,831 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:07:03,831 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:07:03,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:07:03,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:07:03,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:07:03,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:07:03,831 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 -> d0dfba50fbd72a6b5ad9816cf1aa0dae3c94bcfb94eabb013d8300ea77591d1e [2024-11-07 10:07:04,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:07:04,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:07:04,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:07:04,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:07:04,119 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:07:04,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-86.i [2024-11-07 10:07:05,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:07:05,834 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:07:05,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-86.i [2024-11-07 10:07:05,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b38f0557/ed19aef098f24a6582e577792e4a0add/FLAGbea2a715f [2024-11-07 10:07:05,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b38f0557/ed19aef098f24a6582e577792e4a0add [2024-11-07 10:07:05,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:07:05,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:07:05,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:07:05,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:07:05,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:07:05,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:05" (1/1) ... [2024-11-07 10:07:05,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a28cead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:05, skipping insertion in model container [2024-11-07 10:07:05,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:05" (1/1) ... [2024-11-07 10:07:05,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:07:06,039 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_variablewrapping_normal_file-86.i[913,926] [2024-11-07 10:07:06,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:07:06,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:07:06,150 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_variablewrapping_normal_file-86.i[913,926] [2024-11-07 10:07:06,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:07:06,212 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:07:06,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06 WrapperNode [2024-11-07 10:07:06,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:07:06,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:07:06,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:07:06,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:07:06,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,273 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-07 10:07:06,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:07:06,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:07:06,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:07:06,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:07:06,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,313 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 10:07:06,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:07:06,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:07:06,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:07:06,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:07:06,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (1/1) ... [2024-11-07 10:07:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:07:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:07:06,392 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 10:07:06,399 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 10:07:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:07:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:07:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:07:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:07:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:07:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:07:06,514 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:07:06,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:07:07,029 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 10:07:07,031 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:07:07,040 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:07:07,042 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:07:07,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:07 BoogieIcfgContainer [2024-11-07 10:07:07,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:07:07,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:07:07,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:07:07,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:07:07,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:07:05" (1/3) ... [2024-11-07 10:07:07,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241d7fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:07, skipping insertion in model container [2024-11-07 10:07:07,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:06" (2/3) ... [2024-11-07 10:07:07,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241d7fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:07, skipping insertion in model container [2024-11-07 10:07:07,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:07" (3/3) ... [2024-11-07 10:07:07,055 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-86.i [2024-11-07 10:07:07,069 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:07:07,070 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:07:07,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:07:07,142 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;@1ada8c8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:07:07,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:07:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 10:07:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:07:07,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:07,161 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:07,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:07,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash -195440256, now seen corresponding path program 1 times [2024-11-07 10:07:07,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:07:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386650776] [2024-11-07 10:07:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:07,180 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 10:07:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:07:07,185 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 10:07:07,187 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 10:07:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:07,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:07:07,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:07:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-07 10:07:07,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:07:07,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:07:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386650776] [2024-11-07 10:07:07,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386650776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:07,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:07,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:07:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010271500] [2024-11-07 10:07:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:07:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:07:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:07:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:07:07,571 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 10:07:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:07,602 INFO L93 Difference]: Finished difference Result 121 states and 209 transitions. [2024-11-07 10:07:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:07:07,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 153 [2024-11-07 10:07:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:07,611 INFO L225 Difference]: With dead ends: 121 [2024-11-07 10:07:07,611 INFO L226 Difference]: Without dead ends: 60 [2024-11-07 10:07:07,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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 10:07:07,618 INFO L432 NwaCegarLoop]: 88 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, 88 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 10:07:07,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:07:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-07 10:07:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-07 10:07:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 10:07:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2024-11-07 10:07:07,661 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 153 [2024-11-07 10:07:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:07,661 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2024-11-07 10:07:07,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 10:07:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2024-11-07 10:07:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:07:07,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:07,664 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:07,674 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 10:07:07,865 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 10:07:07,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:07,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1362029510, now seen corresponding path program 1 times [2024-11-07 10:07:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:07:07,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100946581] [2024-11-07 10:07:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:07,868 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 10:07:07,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:07:07,872 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 10:07:07,873 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 10:07:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:08,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:07:08,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:07:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 10:07:08,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:07:08,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:07:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100946581] [2024-11-07 10:07:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100946581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:08,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:08,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:07:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535239851] [2024-11-07 10:07:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:08,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:07:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:07:08,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:07:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:07:08,218 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 10:07:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:08,494 INFO L93 Difference]: Finished difference Result 130 states and 189 transitions. [2024-11-07 10:07:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:07:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 153 [2024-11-07 10:07:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:08,512 INFO L225 Difference]: With dead ends: 130 [2024-11-07 10:07:08,515 INFO L226 Difference]: Without dead ends: 73 [2024-11-07 10:07:08,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 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 10:07:08,517 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:07:08,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:07:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-07 10:07:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2024-11-07 10:07:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 10:07:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-07 10:07:08,537 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 153 [2024-11-07 10:07:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:08,542 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-07 10:07:08,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 10:07:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-07 10:07:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:07:08,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:08,547 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:08,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:07:08,747 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 10:07:08,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:08,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2042087880, now seen corresponding path program 1 times [2024-11-07 10:07:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:07:08,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504861108] [2024-11-07 10:07:08,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:08,749 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 10:07:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:07:08,753 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 10:07:08,754 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 10:07:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:09,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 10:07:09,048 INFO L278 TraceCheckSpWp]: Computing forward predicates...