./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl --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 b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:10:00,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:10:00,660 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:10:00,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:10:00,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:10:00,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:10:00,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:10:00,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:10:00,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:10:00,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:10:00,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:10:00,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:10:00,719 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:10:00,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:10:00,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:10:00,722 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:10:00,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:10:00,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:10:00,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:10:00,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:10:00,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:10:00,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:10:00,725 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:10:00,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:10:00,726 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:10:00,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:10:00,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:10:00,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:10:00,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:10:00,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:10:00,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:10:00,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:10:00,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:10:00,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:10:00,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:10:00,730 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:10:00,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:10:00,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:10:00,731 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:10:00,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl 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 -> b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e [2023-11-12 02:10:01,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:10:01,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:10:01,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:10:01,045 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:10:01,045 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:10:01,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-12 02:10:04,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:10:04,346 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:10:04,347 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-12 02:10:04,360 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data/728f2eb1b/e2f92601d62d44a78601e2db5ac46b1f/FLAG73a68385e [2023-11-12 02:10:04,379 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data/728f2eb1b/e2f92601d62d44a78601e2db5ac46b1f [2023-11-12 02:10:04,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:10:04,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:10:04,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:10:04,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:10:04,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:10:04,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1183c80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04, skipping insertion in model container [2023-11-12 02:10:04,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,440 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:10:04,642 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-12 02:10:04,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:10:04,706 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:10:04,728 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-12 02:10:04,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:10:04,772 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:10:04,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04 WrapperNode [2023-11-12 02:10:04,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:10:04,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:10:04,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:10:04,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:10:04,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,818 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-11-12 02:10:04,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:10:04,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:10:04,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:10:04,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:10:04,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:10:04,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:10:04,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:10:04,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:10:04,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (1/1) ... [2023-11-12 02:10:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:10:04,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:04,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:04,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:10:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:10:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:10:04,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:10:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:10:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:10:04,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:10:05,018 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:10:05,020 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:10:05,232 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:10:05,240 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:10:05,240 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:10:05,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:10:05 BoogieIcfgContainer [2023-11-12 02:10:05,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:10:05,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:10:05,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:10:05,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:10:05,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:10:04" (1/3) ... [2023-11-12 02:10:05,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e10c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:10:05, skipping insertion in model container [2023-11-12 02:10:05,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:04" (2/3) ... [2023-11-12 02:10:05,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e10c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:10:05, skipping insertion in model container [2023-11-12 02:10:05,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:10:05" (3/3) ... [2023-11-12 02:10:05,253 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-12 02:10:05,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:10:05,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:10:05,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:10:05,335 INFO L357 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, mHoare=true, 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;@614748fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:10:05,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:10:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:10:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-12 02:10:05,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:05,353 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:05,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:10:05,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1369718972, now seen corresponding path program 1 times [2023-11-12 02:10:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307486872] [2023-11-12 02:10:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:10:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:10:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:10:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:10:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:10:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:10:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:10:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:10:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:10:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-12 02:10:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307486872] [2023-11-12 02:10:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307486872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:05,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:10:05,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265291924] [2023-11-12 02:10:05,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:05,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:10:05,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:10:05,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:10:05,707 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:10:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:05,735 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2023-11-12 02:10:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:10:05,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2023-11-12 02:10:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:05,746 INFO L225 Difference]: With dead ends: 79 [2023-11-12 02:10:05,764 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 02:10:05,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:10:05,775 INFO L413 NwaCegarLoop]: 54 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, 54 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 [2023-11-12 02:10:05,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:10:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 02:10:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-12 02:10:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:10:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-12 02:10:05,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 62 [2023-11-12 02:10:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:05,828 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-12 02:10:05,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:10:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-11-12 02:10:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-12 02:10:05,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:05,832 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:05,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:10:05,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:10:05,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1314089786, now seen corresponding path program 1 times [2023-11-12 02:10:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:05,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927735333] [2023-11-12 02:10:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:05,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:10:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:10:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:10:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:10:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:10:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:10:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:10:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:10:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:10:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-12 02:10:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927735333] [2023-11-12 02:10:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927735333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:10:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612352983] [2023-11-12 02:10:06,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:06,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:10:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:06,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:10:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:10:06,360 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-12 02:10:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:06,513 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2023-11-12 02:10:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:10:06,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2023-11-12 02:10:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:06,516 INFO L225 Difference]: With dead ends: 105 [2023-11-12 02:10:06,516 INFO L226 Difference]: Without dead ends: 71 [2023-11-12 02:10:06,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:10:06,519 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 45 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:06,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 176 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:10:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-12 02:10:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-11-12 02:10:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:10:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2023-11-12 02:10:06,552 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 62 [2023-11-12 02:10:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:06,553 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2023-11-12 02:10:06,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-12 02:10:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2023-11-12 02:10:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-12 02:10:06,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:06,556 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:06,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:10:06,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:10:06,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1257039997, now seen corresponding path program 1 times [2023-11-12 02:10:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956376383] [2023-11-12 02:10:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:06,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:06,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:06,759 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:10:06,760 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:10:06,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:10:06,766 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-12 02:10:06,769 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:10:06,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:10:06 BoogieIcfgContainer [2023-11-12 02:10:06,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:10:06,863 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:10:06,863 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:10:06,863 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:10:06,864 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:10:05" (3/4) ... [2023-11-12 02:10:06,866 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:10:06,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:10:06,868 INFO L158 Benchmark]: Toolchain (without parser) took 2478.93ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 64.1MB in the end (delta: 39.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2023-11-12 02:10:06,868 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:10:06,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.71ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 91.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:10:06,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.06ms. Allocated memory is still 144.7MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:10:06,877 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 144.7MB. Free memory was 89.5MB in the beginning and 88.6MB in the end (delta: 871.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:10:06,880 INFO L158 Benchmark]: RCFGBuilder took 393.92ms. Allocated memory is still 144.7MB. Free memory was 88.6MB in the beginning and 75.4MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:10:06,881 INFO L158 Benchmark]: TraceAbstraction took 1616.97ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 64.5MB in the end (delta: 10.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-11-12 02:10:06,882 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 144.7MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:10:06,883 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 100.7MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.71ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 91.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.06ms. Allocated memory is still 144.7MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 144.7MB. Free memory was 89.5MB in the beginning and 88.6MB in the end (delta: 871.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 393.92ms. Allocated memory is still 144.7MB. Free memory was 88.6MB in the beginning and 75.4MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1616.97ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 64.5MB in the end (delta: 10.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 144.7MB. Free memory is still 64.1MB. 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 someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned short int var_1_3 = 16; [L24] unsigned long int var_1_7 = 1000; [L25] signed char var_1_8 = -4; [L26] signed short int var_1_9 = 2; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_11 = 0; [L29] double var_1_12 = 0.95; [L30] double var_1_13 = 9.8; [L31] signed short int last_1_var_1_9 = 2; [L32] unsigned char last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L87] isInitial = 1 [L88] FCALL initially() [L89] int k_loop; [L90] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L90] COND TRUE k_loop < 1 [L91] CALL updateLastVariables() [L79] last_1_var_1_9 = var_1_9 [L80] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L63] var_1_3 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-4, var_1_9=2] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-4, var_1_9=2] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-4, var_1_9=2] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-4, var_1_9=2] [L69] var_1_8 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L70] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L71] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L72] var_1_11 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L74] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=1005, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=1005, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=1005, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L92] RET updateVariables() [L93] CALL step() [L36] signed long int stepLocal_2 = last_1_var_1_9; [L37] unsigned char stepLocal_1 = (- var_1_7) <= last_1_var_1_9; [L38] unsigned char stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=1005, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L39] COND TRUE stepLocal_0 || ((~ last_1_var_1_9) >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=1005, var_1_1=-128, var_1_7=0, var_1_8=-1, var_1_9=2] [L40] COND FALSE !(last_1_var_1_9 < stepLocal_2) [L49] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=1005, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L54] var_1_10 = var_1_11 [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L56] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_1=1, stepLocal_2=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_7=0, var_1_8=-1, var_1_9=2] [L93] RET step() [L94] CALL, EXPR property() [L83-L84] return ((((last_1_var_1_10 || ((~ last_1_var_1_9) >= last_1_var_1_9)) ? ((last_1_var_1_9 < last_1_var_1_9) ? ((! last_1_var_1_10) ? (((last_1_var_1_9 > last_1_var_1_9) && ((- var_1_7) <= last_1_var_1_9)) ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_8))) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && (var_1_10 ? ((((4131182089u - var_1_3) - 200u) < var_1_1) ? (var_1_9 == ((signed short int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) var_1_13)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_3=0, var_1_7=0, var_1_8=-1, var_1_9=2] [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_3=0, var_1_7=0, var_1_8=-1, var_1_9=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=0, var_1_11=0, var_1_12=1005, var_1_13=1005, var_1_1=-1, var_1_3=0, var_1_7=0, var_1_8=-1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 100 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 288/288 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 [2023-11-12 02:10:06,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl --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 b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:10:09,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:10:09,703 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-12 02:10:09,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:10:09,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:10:09,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:10:09,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:10:09,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:10:09,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:10:09,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:10:09,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:10:09,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:10:09,776 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:10:09,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:10:09,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:10:09,779 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:10:09,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:10:09,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:10:09,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:10:09,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:10:09,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:10:09,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:10:09,784 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:10:09,785 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:10:09,785 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:10:09,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:10:09,786 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:10:09,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:10:09,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:10:09,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:10:09,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:10:09,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:10:09,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:10:09,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:10:09,791 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:10:09,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:10:09,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:10:09,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:10:09,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:10:09,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:10:09,794 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:10:09,794 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:10:09,795 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl 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 -> b8e52945473f8a7c8eae1b0fc6b7ff8d7bdd237133fbc5cccb42de41250f237e [2023-11-12 02:10:10,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:10:10,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:10:10,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:10:10,235 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:10:10,236 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:10:10,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-12 02:10:13,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:10:13,683 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:10:13,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-12 02:10:13,694 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data/31910bb1e/b1f01ffc883344bc92a707e350fbf8ae/FLAG3198ad661 [2023-11-12 02:10:13,707 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/data/31910bb1e/b1f01ffc883344bc92a707e350fbf8ae [2023-11-12 02:10:13,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:10:13,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:10:13,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:10:13,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:10:13,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:10:13,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:10:13" (1/1) ... [2023-11-12 02:10:13,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a5964c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:13, skipping insertion in model container [2023-11-12 02:10:13,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:10:13" (1/1) ... [2023-11-12 02:10:13,749 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:10:13,906 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-12 02:10:13,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:10:13,967 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:10:13,991 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-15.i[915,928] [2023-11-12 02:10:14,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:10:14,065 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:10:14,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14 WrapperNode [2023-11-12 02:10:14,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:10:14,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:10:14,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:10:14,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:10:14,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,165 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2023-11-12 02:10:14,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:10:14,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:10:14,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:10:14,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:10:14,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:10:14,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:10:14,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:10:14,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:10:14,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (1/1) ... [2023-11-12 02:10:14,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:10:14,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:14,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:14,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:10:14,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:10:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:10:14,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:10:14,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:10:14,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:10:14,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:10:14,495 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:10:14,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:10:14,775 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:10:14,784 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:10:14,787 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:10:14,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:10:14 BoogieIcfgContainer [2023-11-12 02:10:14,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:10:14,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:10:14,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:10:14,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:10:14,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:10:13" (1/3) ... [2023-11-12 02:10:14,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd11463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:10:14, skipping insertion in model container [2023-11-12 02:10:14,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:10:14" (2/3) ... [2023-11-12 02:10:14,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd11463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:10:14, skipping insertion in model container [2023-11-12 02:10:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:10:14" (3/3) ... [2023-11-12 02:10:14,801 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-15.i [2023-11-12 02:10:14,819 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:10:14,820 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:10:14,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:10:14,888 INFO L357 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, mHoare=true, 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;@723affe5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:10:14,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:10:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:10:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-12 02:10:14,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:14,905 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:14,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:10:14,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1369718972, now seen corresponding path program 1 times [2023-11-12 02:10:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:10:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520682859] [2023-11-12 02:10:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:14,937 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 [2023-11-12 02:10:14,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:10:14,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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) [2023-11-12 02:10:14,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:15,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:10:15,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-12 02:10:15,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:10:15,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:10:15,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520682859] [2023-11-12 02:10:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520682859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:15,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:15,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:10:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753942935] [2023-11-12 02:10:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:15,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:10:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:10:15,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:10:15,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:10:15,219 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:10:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:15,246 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2023-11-12 02:10:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:10:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2023-11-12 02:10:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:15,257 INFO L225 Difference]: With dead ends: 79 [2023-11-12 02:10:15,257 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 02:10:15,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:10:15,265 INFO L413 NwaCegarLoop]: 54 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, 54 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 [2023-11-12 02:10:15,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:10:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 02:10:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-12 02:10:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-12 02:10:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-12 02:10:15,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 62 [2023-11-12 02:10:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:15,326 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-12 02:10:15,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:10:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-11-12 02:10:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-12 02:10:15,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:15,335 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:15,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:15,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:15,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:10:15,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1314089786, now seen corresponding path program 1 times [2023-11-12 02:10:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:10:15,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226910103] [2023-11-12 02:10:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:15,554 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 [2023-11-12 02:10:15,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:10:15,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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) [2023-11-12 02:10:15,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:15,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:10:15,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-12 02:10:15,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:10:15,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:10:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226910103] [2023-11-12 02:10:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226910103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:15,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:10:15,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383568312] [2023-11-12 02:10:15,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:15,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:10:15,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:10:15,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:10:15,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:10:15,942 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-12 02:10:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:16,168 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2023-11-12 02:10:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:10:16,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2023-11-12 02:10:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:16,171 INFO L225 Difference]: With dead ends: 105 [2023-11-12 02:10:16,171 INFO L226 Difference]: Without dead ends: 71 [2023-11-12 02:10:16,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:10:16,174 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:16,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 174 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:10:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-12 02:10:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-11-12 02:10:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:10:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2023-11-12 02:10:16,193 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 62 [2023-11-12 02:10:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:16,194 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2023-11-12 02:10:16,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-12 02:10:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2023-11-12 02:10:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-12 02:10:16,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:16,196 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:16,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:16,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:16,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:10:16,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1257039997, now seen corresponding path program 1 times [2023-11-12 02:10:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:10:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679275624] [2023-11-12 02:10:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:16,420 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 [2023-11-12 02:10:16,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:10:16,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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) [2023-11-12 02:10:16,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:16,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-12 02:10:16,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-12 02:10:26,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:10:26,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:10:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679275624] [2023-11-12 02:10:26,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679275624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:26,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:26,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:10:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538773241] [2023-11-12 02:10:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:26,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 02:10:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:10:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:10:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:10:26,932 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:10:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:29,246 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2023-11-12 02:10:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-12 02:10:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2023-11-12 02:10:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:29,250 INFO L225 Difference]: With dead ends: 156 [2023-11-12 02:10:29,250 INFO L226 Difference]: Without dead ends: 122 [2023-11-12 02:10:29,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2023-11-12 02:10:29,253 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:29,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 309 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-12 02:10:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-12 02:10:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2023-11-12 02:10:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-12 02:10:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2023-11-12 02:10:29,277 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 63 [2023-11-12 02:10:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:29,278 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2023-11-12 02:10:29,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:10:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2023-11-12 02:10:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-12 02:10:29,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:10:29,280 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:29,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:29,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:29,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:10:29,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1437898979, now seen corresponding path program 1 times [2023-11-12 02:10:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:10:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363068251] [2023-11-12 02:10:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:29,497 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 [2023-11-12 02:10:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:10:29,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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) [2023-11-12 02:10:29,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:29,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:10:29,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-12 02:10:29,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:10:29,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:10:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363068251] [2023-11-12 02:10:29,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363068251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:10:29,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:10:29,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:10:29,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759062768] [2023-11-12 02:10:29,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:10:29,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:10:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:10:29,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:10:29,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:10:29,782 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-12 02:10:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:29,944 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2023-11-12 02:10:29,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:10:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2023-11-12 02:10:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:10:29,946 INFO L225 Difference]: With dead ends: 135 [2023-11-12 02:10:29,946 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:10:29,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:10:29,951 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:10:29,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 49 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:10:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:10:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:10:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:10:29,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-11-12 02:10:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:10:29,954 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:10:29,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-12 02:10:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:10:29,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:10:29,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:10:29,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:30,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:10:30,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:10:31,490 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-12 02:10:31,490 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-12 02:10:31,491 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-11-12 02:10:31,491 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:10:31,491 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-12 02:10:31,491 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-12 02:10:31,491 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-12 02:10:31,491 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 86 98) no Hoare annotation was computed. [2023-11-12 02:10:31,492 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-12 02:10:31,492 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 50) no Hoare annotation was computed. [2023-11-12 02:10:31,492 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-12 02:10:31,492 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:10:31,492 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:10:31,493 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 59) no Hoare annotation was computed. [2023-11-12 02:10:31,493 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:10:31,493 INFO L899 garLoopResultBuilder]: For program point L90-2(lines 90 96) no Hoare annotation was computed. [2023-11-12 02:10:31,493 INFO L895 garLoopResultBuilder]: At program point L90-3(lines 90 96) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-12 02:10:31,493 INFO L899 garLoopResultBuilder]: For program point L90-4(lines 90 96) no Hoare annotation was computed. [2023-11-12 02:10:31,494 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 81) no Hoare annotation was computed. [2023-11-12 02:10:31,494 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 82 85) no Hoare annotation was computed. [2023-11-12 02:10:31,494 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-12 02:10:31,494 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 47) no Hoare annotation was computed. [2023-11-12 02:10:31,494 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-12 02:10:31,495 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-12 02:10:31,495 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2023-11-12 02:10:31,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:10:31,495 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-12 02:10:31,495 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:10:31,496 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-12 02:10:31,496 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-12 02:10:31,496 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv2 16))) (.cse1 (= ~last_1_var_1_9~0 (_ bv2 16))) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse5)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse6))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse6))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse5))))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~var_1_1~0 ~var_1_8~0) .cse0 .cse1 (= ~var_1_13~0 ~var_1_12~0) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) .cse2 .cse3 (= ~var_1_10~0 ~var_1_11~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~last_1_var_1_10~0 (_ bv1 8)) .cse4 (= (_ bv1 8) ~var_1_10~0)))) [2023-11-12 02:10:31,496 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (= ~var_1_9~0 (_ bv2 16)) (= ~last_1_var_1_9~0 (_ bv2 16)) (bvsle ((_ zero_extend 24) ~var_1_11~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-12 02:10:31,497 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 62 77) no Hoare annotation was computed. [2023-11-12 02:10:31,497 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 53) no Hoare annotation was computed. [2023-11-12 02:10:31,497 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 53) no Hoare annotation was computed. [2023-11-12 02:10:31,497 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-12 02:10:31,497 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 61) no Hoare annotation was computed. [2023-11-12 02:10:31,497 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-12 02:10:31,498 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-12 02:10:31,498 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-12 02:10:31,498 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-12 02:10:31,503 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-12 02:10:31,505 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:10:31,525 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,526 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,527 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,527 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,528 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,528 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,529 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,530 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,531 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,539 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,541 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,542 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,542 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,542 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,545 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,546 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,547 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,547 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,547 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,548 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:10:31 BoogieIcfgContainer [2023-11-12 02:10:31,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:10:31,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:10:31,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:10:31,552 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:10:31,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:10:14" (3/4) ... [2023-11-12 02:10:31,555 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:10:31,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 02:10:31,568 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-12 02:10:31,569 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-12 02:10:31,569 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:10:31,569 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:10:31,601 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (last_1_var_1_9 == 2)) && (var_1_13 == var_1_12)) && (\result == 1)) && (var_1_11 <= 0)) && (var_1_10 == var_1_11)) || (((((var_1_9 == 2) && (last_1_var_1_9 == 2)) && (var_1_11 <= 0)) && (last_1_var_1_10 == 1)) && (1 == var_1_10))) [2023-11-12 02:10:31,624 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (last_1_var_1_9 == 2)) && (var_1_13 == var_1_12)) && (\result == 1)) && (var_1_11 <= 0)) && (var_1_10 == var_1_11)) || (((((var_1_9 == 2) && (last_1_var_1_9 == 2)) && (var_1_11 <= 0)) && (last_1_var_1_10 == 1)) && (1 == var_1_10))) [2023-11-12 02:10:31,683 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:10:31,684 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:10:31,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:10:31,685 INFO L158 Benchmark]: Toolchain (without parser) took 17974.04ms. Allocated memory was 71.3MB in the beginning and 333.4MB in the end (delta: 262.1MB). Free memory was 47.8MB in the beginning and 267.2MB in the end (delta: -219.4MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2023-11-12 02:10:31,685 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 71.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:10:31,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.45ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 35.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:10:31,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.42ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 35.1MB in the beginning and 71.8MB in the end (delta: -36.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-11-12 02:10:31,686 INFO L158 Benchmark]: Boogie Preprocessor took 83.65ms. Allocated memory is still 92.3MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:10:31,687 INFO L158 Benchmark]: RCFGBuilder took 539.05ms. Allocated memory is still 92.3MB. Free memory was 70.2MB in the beginning and 56.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:10:31,687 INFO L158 Benchmark]: TraceAbstraction took 16757.22ms. Allocated memory was 92.3MB in the beginning and 333.4MB in the end (delta: 241.2MB). Free memory was 55.9MB in the beginning and 272.4MB in the end (delta: -216.5MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. [2023-11-12 02:10:31,688 INFO L158 Benchmark]: Witness Printer took 132.19ms. Allocated memory is still 333.4MB. Free memory was 272.4MB in the beginning and 267.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:10:31,690 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.28ms. Allocated memory is still 71.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.45ms. Allocated memory is still 71.3MB. Free memory was 47.6MB in the beginning and 35.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.42ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 35.1MB in the beginning and 71.8MB in the end (delta: -36.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.65ms. Allocated memory is still 92.3MB. Free memory was 71.8MB in the beginning and 70.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 539.05ms. Allocated memory is still 92.3MB. Free memory was 70.2MB in the beginning and 56.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16757.22ms. Allocated memory was 92.3MB in the beginning and 333.4MB in the end (delta: 241.2MB). Free memory was 55.9MB in the beginning and 272.4MB in the end (delta: -216.5MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. * Witness Printer took 132.19ms. Allocated memory is still 333.4MB. Free memory was 272.4MB in the beginning and 267.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 586 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 395 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 191 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 68 PreInvPairs, 88 NumberOfFragments, 694 HoareAnnotationTreeSize, 68 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1009 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 887 SizeOfPredicates, 21 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 90]: Loop Invariant [2023-11-12 02:10:31,703 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,703 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,703 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,703 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,704 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,704 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,704 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,705 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,705 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,705 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,706 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,707 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,707 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,707 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,707 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,708 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,708 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,708 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,709 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-12 02:10:31,709 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated Derived loop invariant: ((((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (last_1_var_1_9 == 2)) && (var_1_13 == var_1_12)) && (\result == 1)) && (var_1_11 <= 0)) && (var_1_10 == var_1_11)) || (((((var_1_9 == 2) && (last_1_var_1_9 == 2)) && (var_1_11 <= 0)) && (last_1_var_1_10 == 1)) && (1 == var_1_10))) RESULT: Ultimate proved your program to be correct! [2023-11-12 02:10:31,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3dfaf5-7eb4-4f0d-a89f-e2fd32f03feb/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE