./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.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-88.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', '2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18'] 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-88.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 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:07:26,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:07:26,259 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:07:26,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:07:26,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:07:26,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:07:26,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:07:26,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:07:26,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:07:26,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:07:26,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:07:26,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:07:26,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:07:26,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:07:26,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:07:26,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:07:26,304 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:07:26,305 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:07:26,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:07:26,305 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:07:26,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:07:26,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:07:26,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:07:26,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:07:26,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:07:26,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:07:26,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:07:26,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:07:26,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:07:26,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:07:26,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:07:26,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:07:26,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:07:26,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:07:26,307 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 -> 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 [2024-11-07 10:07:26,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:07:26,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:07:26,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:07:26,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:07:26,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:07:26,613 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-88.i [2024-11-07 10:07:27,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:07:28,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:07:28,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2024-11-07 10:07:28,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7445fbc95/dfb18069829f4bbaaba0a9c97fa6d015/FLAGd36e3cb4b [2024-11-07 10:07:28,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7445fbc95/dfb18069829f4bbaaba0a9c97fa6d015 [2024-11-07 10:07:28,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:07:28,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:07:28,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:07:28,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:07:28,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:07:28,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:28" (1/1) ... [2024-11-07 10:07:28,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d563e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:28, skipping insertion in model container [2024-11-07 10:07:28,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:28" (1/1) ... [2024-11-07 10:07:28,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:07:28,421 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-88.i[913,926] [2024-11-07 10:07:28,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:07:28,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:07:28,508 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-88.i[913,926] [2024-11-07 10:07:28,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:07:28,557 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:07:28,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:28 WrapperNode [2024-11-07 10:07:28,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:07:28,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:07:28,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:07:28,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:07:28,566 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:28" (1/1) ... [2024-11-07 10:07:28,577 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:28" (1/1) ... [2024-11-07 10:07:28,608 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-07 10:07:28,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:07:28,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:07:28,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:07:28,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:07:28,617 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:28" (1/1) ... [2024-11-07 10:07:28,617 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:28" (1/1) ... [2024-11-07 10:07:28,619 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:28" (1/1) ... [2024-11-07 10:07:28,629 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:28,629 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:28" (1/1) ... [2024-11-07 10:07:28,630 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:28" (1/1) ... [2024-11-07 10:07:28,634 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:28" (1/1) ... [2024-11-07 10:07:28,642 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:28" (1/1) ... [2024-11-07 10:07:28,647 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:28" (1/1) ... [2024-11-07 10:07:28,648 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:28" (1/1) ... [2024-11-07 10:07:28,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:07:28,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:07:28,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:07:28,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:07:28,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:28" (1/1) ... [2024-11-07 10:07:28,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:07:28,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:07:28,690 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:28,696 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:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:07:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:07:28,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:07:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:07:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:07:28,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:07:28,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:07:28,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:07:29,047 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 10:07:29,047 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:07:29,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:07:29,058 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:07:29,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:29 BoogieIcfgContainer [2024-11-07 10:07:29,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:07:29,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:07:29,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:07:29,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:07:29,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:07:28" (1/3) ... [2024-11-07 10:07:29,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265e236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:29, skipping insertion in model container [2024-11-07 10:07:29,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:28" (2/3) ... [2024-11-07 10:07:29,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265e236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:29, skipping insertion in model container [2024-11-07 10:07:29,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:29" (3/3) ... [2024-11-07 10:07:29,071 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-88.i [2024-11-07 10:07:29,085 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:07:29,085 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:07:29,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:07:29,165 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;@25a8b95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:07:29,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:07:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:07:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:07:29,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:29,178 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash -849179731, now seen corresponding path program 1 times [2024-11-07 10:07:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:29,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405970062] [2024-11-07 10:07:29,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:07:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:07:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:07:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:07:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:07:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:07:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:07:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:07:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:07:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:07:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:07:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:07:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:07:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:07:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:07:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 10:07:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:07:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:07:29,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:07:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405970062] [2024-11-07 10:07:29,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405970062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:29,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:29,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:07:29,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101358719] [2024-11-07 10:07:29,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:07:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:07:29,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:07:29,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:07:29,565 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:07:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:29,593 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2024-11-07 10:07:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:07:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-11-07 10:07:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:29,604 INFO L225 Difference]: With dead ends: 109 [2024-11-07 10:07:29,604 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 10:07:29,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:29,610 INFO L432 NwaCegarLoop]: 79 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, 79 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:29,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 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:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 10:07:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 10:07:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:07:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-07 10:07:29,653 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 111 [2024-11-07 10:07:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:29,656 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-07 10:07:29,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:07:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-07 10:07:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:07:29,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:29,660 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:07:29,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:29,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -665723601, now seen corresponding path program 1 times [2024-11-07 10:07:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:29,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755826522] [2024-11-07 10:07:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:07:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:07:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:07:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:07:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:07:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:07:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:07:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:07:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:07:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:07:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:07:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:07:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:07:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:07:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:07:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 10:07:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:07:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:07:30,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:07:30,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755826522] [2024-11-07 10:07:30,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755826522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:30,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:30,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:07:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932794291] [2024-11-07 10:07:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:30,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:07:30,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:07:30,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:07:30,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:07:30,634 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:30,911 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2024-11-07 10:07:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:07:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-07 10:07:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:30,914 INFO L225 Difference]: With dead ends: 157 [2024-11-07 10:07:30,914 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:07:30,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:07:30,916 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:07:30,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 202 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:07:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:07:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2024-11-07 10:07:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:07:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-07 10:07:30,960 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 111 [2024-11-07 10:07:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:30,961 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-07 10:07:30,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-07 10:07:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:07:30,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:30,964 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:07:30,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:30,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1594133825, now seen corresponding path program 1 times [2024-11-07 10:07:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997365735] [2024-11-07 10:07:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:07:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:07:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:07:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:07:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:07:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:07:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:07:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:07:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:07:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:07:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:07:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:07:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:07:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:07:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:07:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 10:07:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:07:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:07:31,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:07:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997365735] [2024-11-07 10:07:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997365735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:31,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:07:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387812762] [2024-11-07 10:07:31,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:31,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:07:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:07:31,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:07:31,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:07:31,290 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:31,480 INFO L93 Difference]: Finished difference Result 165 states and 243 transitions. [2024-11-07 10:07:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:07:31,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-07 10:07:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:31,483 INFO L225 Difference]: With dead ends: 165 [2024-11-07 10:07:31,483 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:07:31,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:07:31,486 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:07:31,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 206 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:07:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:07:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-07 10:07:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:07:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-11-07 10:07:31,515 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 113 [2024-11-07 10:07:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:31,516 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-11-07 10:07:31,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-11-07 10:07:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:07:31,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:31,519 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:07:31,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:31,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1203828785, now seen corresponding path program 1 times [2024-11-07 10:07:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411351472] [2024-11-07 10:07:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:07:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:07:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:07:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:07:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:07:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:07:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:07:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:07:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:07:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:07:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:07:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:07:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:07:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:07:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:07:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 10:07:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:07:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:07:31,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:07:31,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411351472] [2024-11-07 10:07:31,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411351472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:31,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:31,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:07:31,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32318448] [2024-11-07 10:07:31,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:31,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:07:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:07:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:07:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:07:31,934 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:32,239 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-11-07 10:07:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:07:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-07 10:07:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:32,242 INFO L225 Difference]: With dead ends: 193 [2024-11-07 10:07:32,244 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 10:07:32,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:07:32,246 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 147 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:07:32,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 338 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:07:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 10:07:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 99. [2024-11-07 10:07:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:07:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-11-07 10:07:32,276 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 115 [2024-11-07 10:07:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:32,279 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-11-07 10:07:32,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-07 10:07:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:07:32,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:32,280 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:07:32,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:32,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash -945663347, now seen corresponding path program 1 times [2024-11-07 10:07:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:07:32,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090031367] [2024-11-07 10:07:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:32,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:07:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:07:32,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:07:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:07:32,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:07:32,472 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:07:32,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:07:32,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:07:32,477 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 10:07:32,580 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:07:32,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:07:32 BoogieIcfgContainer [2024-11-07 10:07:32,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:07:32,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:07:32,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:07:32,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:07:32,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:29" (3/4) ... [2024-11-07 10:07:32,591 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:07:32,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:07:32,592 INFO L158 Benchmark]: Toolchain (without parser) took 4333.99ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.9MB in the beginning and 93.3MB in the end (delta: -16.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:07:32,593 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:07:32,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.14ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 64.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:07:32,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.32ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:07:32,593 INFO L158 Benchmark]: Boogie Preprocessor took 44.50ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 60.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:07:32,594 INFO L158 Benchmark]: RCFGBuilder took 404.11ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 43.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:07:32,594 INFO L158 Benchmark]: TraceAbstraction took 3525.16ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 43.1MB in the beginning and 93.3MB in the end (delta: -50.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-07 10:07:32,594 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 125.8MB. Free memory was 93.3MB in the beginning and 93.3MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:07:32,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.14ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 64.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.32ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.50ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 60.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.11ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 43.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3525.16ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 43.1MB in the beginning and 93.3MB in the end (delta: -50.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 125.8MB. Free memory was 93.3MB in the beginning and 93.3MB in the end (delta: 30.0kB). 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 103, overapproximation of bitwiseOr at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = -1; [L26] signed char var_1_8 = -50; [L27] signed char var_1_9 = 100; [L28] unsigned long int var_1_10 = 25; [L29] unsigned long int var_1_11 = 2568920345; [L30] unsigned long int var_1_12 = 1191097264; [L31] unsigned long int var_1_13 = 1801344522; [L32] signed long int var_1_14 = 64; [L33] signed short int var_1_15 = -16; [L34] float var_1_16 = 1000000.5; [L35] float var_1_17 = 4.5; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 128; [L38] unsigned long int last_1_var_1_10 = 25; [L39] signed short int last_1_var_1_15 = -16; [L40] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L98] last_1_var_1_10 = var_1_10 [L99] last_1_var_1_15 = var_1_15 [L100] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L76] var_1_7 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L79] var_1_9 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L80] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L82] var_1_11 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L85] var_1_12 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L88] var_1_13 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L89] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L91] var_1_17 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L92] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L93] var_1_19 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L94] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L111] RET updateVariables() [L112] CALL step() [L44] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L44] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) [L51] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L53] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L56] COND TRUE var_1_12 <= var_1_8 [L57] var_1_14 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L59] var_1_15 = 2 [L60] var_1_16 = var_1_17 [L61] var_1_18 = var_1_19 [L62] unsigned char stepLocal_0 = var_1_8 < var_1_1; VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, stepLocal_0=1, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L63] COND TRUE stepLocal_0 && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7) [L64] var_1_10 = (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L103-L104] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) ? ((var_1_5 && var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed char) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : 1)) && (((var_1_8 < var_1_1) && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7)) ? (var_1_10 == ((unsigned long int) (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)))) : (var_1_10 == ((unsigned long int) (var_1_11 - var_1_13))))) && ((var_1_12 <= var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_15 == ((signed short int) 2))) && (var_1_16 == ((float) var_1_17))) && (var_1_18 == ((unsigned char) var_1_19)) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 825 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 293 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 1527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2176/2176 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:32,627 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-88.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 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:07:34,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:07:34,942 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:34,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:07:34,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:07:34,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:07:34,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:07:34,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:07:34,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:07:34,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:07:34,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:07:34,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:07:34,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:07:34,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:07:34,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:07:34,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:07:34,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:07:34,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:07:34,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:07:34,991 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 -> 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 [2024-11-07 10:07:35,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:07:35,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:07:35,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:07:35,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:07:35,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:07:35,284 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-88.i [2024-11-07 10:07:36,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:07:36,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:07:36,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2024-11-07 10:07:36,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b2062af/7fcfc3e307c94bcfbfe6b2076311a1e7/FLAGb4f4abd8c [2024-11-07 10:07:36,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b2062af/7fcfc3e307c94bcfbfe6b2076311a1e7 [2024-11-07 10:07:36,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:07:36,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:07:36,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:07:36,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:07:36,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:07:36,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:36" (1/1) ... [2024-11-07 10:07:36,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769d416d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:36, skipping insertion in model container [2024-11-07 10:07:36,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:36" (1/1) ... [2024-11-07 10:07:36,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:07:37,116 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-88.i[913,926] [2024-11-07 10:07:37,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:07:37,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:07:37,212 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-88.i[913,926] [2024-11-07 10:07:37,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:07:37,264 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:07:37,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:37 WrapperNode [2024-11-07 10:07:37,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:07:37,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:07:37,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:07:37,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:07:37,274 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:37" (1/1) ... [2024-11-07 10:07:37,286 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:37" (1/1) ... [2024-11-07 10:07:37,309 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-07 10:07:37,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:07:37,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:07:37,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:07:37,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:07:37,321 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:37" (1/1) ... [2024-11-07 10:07:37,321 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:37" (1/1) ... [2024-11-07 10:07:37,328 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:37" (1/1) ... [2024-11-07 10:07:37,341 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:37,342 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:37" (1/1) ... [2024-11-07 10:07:37,342 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:37" (1/1) ... [2024-11-07 10:07:37,357 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:37" (1/1) ... [2024-11-07 10:07:37,364 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:37" (1/1) ... [2024-11-07 10:07:37,366 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:37" (1/1) ... [2024-11-07 10:07:37,371 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:37" (1/1) ... [2024-11-07 10:07:37,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:07:37,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:07:37,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:07:37,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:07:37,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:37" (1/1) ... [2024-11-07 10:07:37,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:07:37,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:07:37,421 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:37,425 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:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:07:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:07:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:07:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:07:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:07:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:07:37,537 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:07:37,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:07:37,774 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 10:07:37,775 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:07:37,785 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:07:37,785 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:07:37,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:37 BoogieIcfgContainer [2024-11-07 10:07:37,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:07:37,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:07:37,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:07:37,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:07:37,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:07:36" (1/3) ... [2024-11-07 10:07:37,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e51a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:37, skipping insertion in model container [2024-11-07 10:07:37,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:37" (2/3) ... [2024-11-07 10:07:37,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e51a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:37, skipping insertion in model container [2024-11-07 10:07:37,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:37" (3/3) ... [2024-11-07 10:07:37,796 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-88.i [2024-11-07 10:07:37,809 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:07:37,810 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:07:37,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:07:37,867 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;@2bc51ecb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:07:37,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:07:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:07:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:07:37,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:37,896 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -151393228, now seen corresponding path program 1 times [2024-11-07 10:07:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:07:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600783847] [2024-11-07 10:07:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:37,909 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:37,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:07:37,913 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:37,915 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:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:38,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:07:38,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:07:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-07 10:07:38,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:07:38,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:07:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600783847] [2024-11-07 10:07:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600783847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:38,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:07:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961450728] [2024-11-07 10:07:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:07:38,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:07:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:07:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:07:38,160 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:07:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:38,181 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-07 10:07:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:07:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-07 10:07:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:38,189 INFO L225 Difference]: With dead ends: 95 [2024-11-07 10:07:38,189 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 10:07:38,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:38,197 INFO L432 NwaCegarLoop]: 68 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, 68 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:38,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 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:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 10:07:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 10:07:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:07:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-07 10:07:38,228 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2024-11-07 10:07:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:38,228 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-07 10:07:38,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:07:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-07 10:07:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:07:38,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:38,234 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,242 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:38,435 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:38,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:38,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 222157298, now seen corresponding path program 1 times [2024-11-07 10:07:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:07:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263524233] [2024-11-07 10:07:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:38,437 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:38,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:07:38,440 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:38,442 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:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:38,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:07:38,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:07:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:07:38,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:07:38,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:07:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263524233] [2024-11-07 10:07:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263524233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:07:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:07:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:07:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022134305] [2024-11-07 10:07:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:07:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:07:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:07:38,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:07:38,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:07:38,928 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:39,134 INFO L93 Difference]: Finished difference Result 158 states and 226 transitions. [2024-11-07 10:07:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:07:39,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-07 10:07:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:39,138 INFO L225 Difference]: With dead ends: 158 [2024-11-07 10:07:39,138 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 10:07:39,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:07:39,139 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 84 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:07:39,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 254 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:07:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 10:07:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2024-11-07 10:07:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:07:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-07 10:07:39,177 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 108 [2024-11-07 10:07:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:39,178 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-07 10:07:39,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:07:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-07 10:07:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:07:39,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:39,180 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,185 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:39,381 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:39,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:39,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash -587189328, now seen corresponding path program 1 times [2024-11-07 10:07:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:07:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388956871] [2024-11-07 10:07:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:39,382 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:39,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:07:39,384 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:39,386 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:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:39,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:07:39,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:07:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 258 proven. 15 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-07 10:07:39,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:07:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:07:40,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:07:40,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388956871] [2024-11-07 10:07:40,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388956871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:07:40,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:07:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-07 10:07:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034337685] [2024-11-07 10:07:40,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:07:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:07:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:07:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:07:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:07:40,149 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 10:07:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:07:40,811 INFO L93 Difference]: Finished difference Result 242 states and 342 transitions. [2024-11-07 10:07:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 10:07:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 108 [2024-11-07 10:07:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:07:40,814 INFO L225 Difference]: With dead ends: 242 [2024-11-07 10:07:40,814 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 10:07:40,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:07:40,819 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 131 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:07:40,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 212 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:07:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 10:07:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 157. [2024-11-07 10:07:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 89 states have (on average 1.1573033707865168) internal successors, (103), 90 states have internal predecessors, (103), 61 states have call successors, (61), 6 states have call predecessors, (61), 6 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-07 10:07:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-11-07 10:07:40,873 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 108 [2024-11-07 10:07:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:07:40,874 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-11-07 10:07:40,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 10:07:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-11-07 10:07:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:07:40,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:07:40,876 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:07:41,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:07:41,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:07:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:07:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1932770606, now seen corresponding path program 1 times [2024-11-07 10:07:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:07:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76752785] [2024-11-07 10:07:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:07:41,079 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:41,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:07:41,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:07:41,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:07:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:07:41,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 10:07:41,191 INFO L278 TraceCheckSpWp]: Computing forward predicates...