./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU --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 c0b7b250742834b6c2f8dcf80b1d0ebeba113b641f9091cd048af26f4ffc4242 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:09:16,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:09:16,552 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:09:16,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:09:16,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:09:16,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:09:16,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:09:16,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:09:16,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:09:16,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:09:16,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:09:16,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:09:16,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:09:16,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:09:16,588 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:09:16,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:09:16,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:09:16,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:09:16,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:09:16,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:09:16,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:09:16,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:09:16,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:09:16,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:09:16,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:09:16,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:09:16,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:09:16,597 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:09:16,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:09:16,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:09:16,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:09:16,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:09:16,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:16,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:09:16,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:09:16,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:09:16,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:09:16,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:09:16,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:09:16,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:09:16,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:09:16,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:09:16,603 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_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/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_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU 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 -> c0b7b250742834b6c2f8dcf80b1d0ebeba113b641f9091cd048af26f4ffc4242 [2024-10-31 22:09:16,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:09:16,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:09:16,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:09:16,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:09:16,950 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:09:16,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i Unable to find full path for "g++" [2024-10-31 22:09:19,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:09:19,461 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:09:19,462 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i [2024-10-31 22:09:19,474 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data/8316d8559/d42ef634ec28499fa331d7a7ddc32fff/FLAG48cf3e3f7 [2024-10-31 22:09:19,495 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data/8316d8559/d42ef634ec28499fa331d7a7ddc32fff [2024-10-31 22:09:19,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:09:19,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:09:19,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:19,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:09:19,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:09:19,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6723f0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19, skipping insertion in model container [2024-10-31 22:09:19,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:09:19,757 WARN L251 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_a1094d5f-8c00-4987-b924-186a9a6086a3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i[915,928] [2024-10-31 22:09:19,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:19,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:09:19,847 WARN L251 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_a1094d5f-8c00-4987-b924-186a9a6086a3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i[915,928] [2024-10-31 22:09:19,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:19,905 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:09:19,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19 WrapperNode [2024-10-31 22:09:19,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:19,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:19,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:09:19,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:09:19,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,960 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-31 22:09:19,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:19,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:09:19,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:09:19,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:09:19,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,995 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:09:19,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:19,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:20,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:20,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:20,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:20,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:20,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:09:20,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:09:20,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:09:20,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:09:20,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (1/1) ... [2024-10-31 22:09:20,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:20,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:09:20,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:09:20,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:09:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:09:20,102 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:09:20,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:09:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:09:20,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:09:20,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:09:20,181 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:09:20,183 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:09:20,527 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-31 22:09:20,527 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:09:20,541 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:09:20,541 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:09:20,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:20 BoogieIcfgContainer [2024-10-31 22:09:20,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:09:20,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:09:20,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:09:20,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:09:20,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:09:19" (1/3) ... [2024-10-31 22:09:20,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23931a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:20, skipping insertion in model container [2024-10-31 22:09:20,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:19" (2/3) ... [2024-10-31 22:09:20,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23931a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:20, skipping insertion in model container [2024-10-31 22:09:20,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:20" (3/3) ... [2024-10-31 22:09:20,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-30.i [2024-10-31 22:09:20,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:09:20,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:09:20,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:09:20,643 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6487f6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:09:20,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:09:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:09:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 22:09:20,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:20,659 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:20,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:20,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1637055942, now seen corresponding path program 1 times [2024-10-31 22:09:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:20,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776980952] [2024-10-31 22:09:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:09:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:09:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:09:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:09:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:09:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:09:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:09:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:09:21,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:21,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776980952] [2024-10-31 22:09:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776980952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:21,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:09:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631222599] [2024-10-31 22:09:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:21,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:09:21,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:21,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:09:21,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:09:21,048 INFO L87 Difference]: Start difference. First operand has 60 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 48 states have internal predecessors, (70), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:09:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:21,081 INFO L93 Difference]: Finished difference Result 113 states and 184 transitions. [2024-10-31 22:09:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:09:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2024-10-31 22:09:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:21,094 INFO L225 Difference]: With dead ends: 113 [2024-10-31 22:09:21,094 INFO L226 Difference]: Without dead ends: 56 [2024-10-31 22:09:21,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:09:21,102 INFO L432 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:21,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:09:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-31 22:09:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-31 22:09:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:09:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-10-31 22:09:21,154 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 78 [2024-10-31 22:09:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:21,155 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-10-31 22:09:21,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:09:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-10-31 22:09:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 22:09:21,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:21,160 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:21,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:09:21,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:21,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1038080014, now seen corresponding path program 1 times [2024-10-31 22:09:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795573085] [2024-10-31 22:09:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:09:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:09:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:09:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:09:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:09:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:09:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:09:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:09:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:21,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795573085] [2024-10-31 22:09:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795573085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:21,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:09:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169011779] [2024-10-31 22:09:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:21,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:09:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:21,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:09:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:09:21,876 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:09:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:22,062 INFO L93 Difference]: Finished difference Result 189 states and 285 transitions. [2024-10-31 22:09:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:09:22,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2024-10-31 22:09:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:22,066 INFO L225 Difference]: With dead ends: 189 [2024-10-31 22:09:22,067 INFO L226 Difference]: Without dead ends: 136 [2024-10-31 22:09:22,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:09:22,074 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 108 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:22,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 263 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:09:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-31 22:09:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 107. [2024-10-31 22:09:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:09:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-31 22:09:22,123 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 78 [2024-10-31 22:09:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:22,124 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-31 22:09:22,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:09:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-31 22:09:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-31 22:09:22,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:22,131 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:22,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:09:22,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:22,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash 283548741, now seen corresponding path program 1 times [2024-10-31 22:09:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346849028] [2024-10-31 22:09:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:09:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:09:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:09:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:09:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:09:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:09:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:09:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-31 22:09:22,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346849028] [2024-10-31 22:09:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346849028] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:09:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789412947] [2024-10-31 22:09:22,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:22,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:09:22,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:09:22,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:09:22,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:09:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:23,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 22:09:23,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:09:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-31 22:09:23,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:09:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-31 22:09:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789412947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:09:23,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:09:23,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-31 22:09:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919144294] [2024-10-31 22:09:23,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:09:23,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:09:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:09:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:09:23,912 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-31 22:09:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:24,418 INFO L93 Difference]: Finished difference Result 206 states and 296 transitions. [2024-10-31 22:09:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:09:24,419 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 79 [2024-10-31 22:09:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:24,422 INFO L225 Difference]: With dead ends: 206 [2024-10-31 22:09:24,422 INFO L226 Difference]: Without dead ends: 153 [2024-10-31 22:09:24,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-10-31 22:09:24,425 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 406 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:24,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 329 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:09:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-31 22:09:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2024-10-31 22:09:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.34375) internal successors, (129), 96 states have internal predecessors, (129), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:09:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2024-10-31 22:09:24,452 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 79 [2024-10-31 22:09:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:24,453 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2024-10-31 22:09:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-31 22:09:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2024-10-31 22:09:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:09:24,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:24,456 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:24,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:09:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:09:24,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:24,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1799865320, now seen corresponding path program 1 times [2024-10-31 22:09:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:24,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433398630] [2024-10-31 22:09:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:09:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:09:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:09:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:09:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:09:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:09:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:09:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:09:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433398630] [2024-10-31 22:09:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433398630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:24,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:09:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915877905] [2024-10-31 22:09:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:24,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:09:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:09:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:09:24,792 INFO L87 Difference]: Start difference. First operand 123 states and 169 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:09:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:24,860 INFO L93 Difference]: Finished difference Result 243 states and 335 transitions. [2024-10-31 22:09:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:09:24,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 80 [2024-10-31 22:09:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:24,864 INFO L225 Difference]: With dead ends: 243 [2024-10-31 22:09:24,864 INFO L226 Difference]: Without dead ends: 123 [2024-10-31 22:09:24,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:09:24,870 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:24,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:09:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-31 22:09:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-31 22:09:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:09:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 167 transitions. [2024-10-31 22:09:24,902 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 167 transitions. Word has length 80 [2024-10-31 22:09:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:24,906 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 167 transitions. [2024-10-31 22:09:24,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:09:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2024-10-31 22:09:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-31 22:09:24,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:24,908 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:24,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:09:24,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:24,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash 186109326, now seen corresponding path program 1 times [2024-10-31 22:09:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034524861] [2024-10-31 22:09:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:24,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-31 22:09:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-31 22:09:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:09:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:09:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:09:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:09:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:09:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:09:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034524861] [2024-10-31 22:09:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034524861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:09:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888803176] [2024-10-31 22:09:25,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:25,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:09:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:09:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:09:25,640 INFO L87 Difference]: Start difference. First operand 123 states and 167 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:09:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:25,807 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2024-10-31 22:09:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:09:25,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2024-10-31 22:09:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:25,811 INFO L225 Difference]: With dead ends: 212 [2024-10-31 22:09:25,811 INFO L226 Difference]: Without dead ends: 151 [2024-10-31 22:09:25,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:09:25,817 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:25,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 213 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:09:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-31 22:09:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2024-10-31 22:09:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:09:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2024-10-31 22:09:25,854 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 81 [2024-10-31 22:09:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:25,857 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2024-10-31 22:09:25,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:09:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2024-10-31 22:09:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-31 22:09:25,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:25,859 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:25,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:09:25,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:25,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash -72056112, now seen corresponding path program 1 times [2024-10-31 22:09:25,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:25,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536546544] [2024-10-31 22:09:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:09:25,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:09:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:09:26,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:09:26,041 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:09:26,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:09:26,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:09:26,049 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-31 22:09:26,153 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:09:26,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:09:26 BoogieIcfgContainer [2024-10-31 22:09:26,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:09:26,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:09:26,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:09:26,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:09:26,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:20" (3/4) ... [2024-10-31 22:09:26,162 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:09:26,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:09:26,168 INFO L158 Benchmark]: Toolchain (without parser) took 6668.49ms. Allocated memory was 127.9MB in the beginning and 199.2MB in the end (delta: 71.3MB). Free memory was 87.9MB in the beginning and 95.7MB in the end (delta: -7.8MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2024-10-31 22:09:26,169 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 104.9MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:09:26,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.83ms. Allocated memory is still 127.9MB. Free memory was 87.9MB in the beginning and 73.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:09:26,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.09ms. Allocated memory is still 127.9MB. Free memory was 73.2MB in the beginning and 70.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:09:26,170 INFO L158 Benchmark]: Boogie Preprocessor took 51.04ms. Allocated memory is still 127.9MB. Free memory was 70.7MB in the beginning and 68.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:09:26,170 INFO L158 Benchmark]: RCFGBuilder took 527.15ms. Allocated memory is still 127.9MB. Free memory was 68.1MB in the beginning and 99.0MB in the end (delta: -30.9MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-10-31 22:09:26,171 INFO L158 Benchmark]: TraceAbstraction took 5614.16ms. Allocated memory was 127.9MB in the beginning and 199.2MB in the end (delta: 71.3MB). Free memory was 98.6MB in the beginning and 96.8MB in the end (delta: 1.8MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-10-31 22:09:26,171 INFO L158 Benchmark]: Witness Printer took 9.69ms. Allocated memory is still 199.2MB. Free memory was 96.8MB in the beginning and 95.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:09:26,174 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.38ms. Allocated memory is still 104.9MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.83ms. Allocated memory is still 127.9MB. Free memory was 87.9MB in the beginning and 73.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.09ms. Allocated memory is still 127.9MB. Free memory was 73.2MB in the beginning and 70.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.04ms. Allocated memory is still 127.9MB. Free memory was 70.7MB in the beginning and 68.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.15ms. Allocated memory is still 127.9MB. Free memory was 68.1MB in the beginning and 99.0MB in the end (delta: -30.9MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5614.16ms. Allocated memory was 127.9MB in the beginning and 199.2MB in the end (delta: 71.3MB). Free memory was 98.6MB in the beginning and 96.8MB in the end (delta: 1.8MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Witness Printer took 9.69ms. Allocated memory is still 199.2MB. Free memory was 96.8MB in the beginning and 95.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] unsigned char last_1_var_1_1 = 1; [L36] signed long int last_1_var_1_11 = -2; [L37] signed long int last_1_var_1_15 = 1000; [L38] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_1 = var_1_1 [L115] last_1_var_1_11 = var_1_11 [L116] last_1_var_1_15 = var_1_15 [L117] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L96] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L98] var_1_7 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L99] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L100] var_1_10 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L101] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L102] var_1_13 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L103] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L104] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L104] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L105] var_1_14 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L106] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L108] var_1_17 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L109] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L110] var_1_18 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L43] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L44] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L49] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L50] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L51] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L53] signed long int stepLocal_2 = var_1_11; [L54] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L55] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L56] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L57] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L58] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L64] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L64] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L75] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L77] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L78] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L82] COND FALSE !(10.55f < var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L87] COND TRUE var_1_16 > var_1_7 [L88] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L120-L121] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_1=-255, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 601 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 422 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 1 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 1158/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:09:26,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU --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 c0b7b250742834b6c2f8dcf80b1d0ebeba113b641f9091cd048af26f4ffc4242 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:09:29,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:09:29,295 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:09:29,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:09:29,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:09:29,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:09:29,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:09:29,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:09:29,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:09:29,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:09:29,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:09:29,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:09:29,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:09:29,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:09:29,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:09:29,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:09:29,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:09:29,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:09:29,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:09:29,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:09:29,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:09:29,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:09:29,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:09:29,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:09:29,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:09:29,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:09:29,365 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:09:29,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:09:29,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:09:29,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:09:29,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:09:29,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:09:29,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:09:29,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:09:29,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:29,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:09:29,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:09:29,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:09:29,372 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:09:29,372 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:09:29,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:09:29,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:09:29,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:09:29,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:09:29,374 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:09:29,374 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_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/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_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU 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 -> c0b7b250742834b6c2f8dcf80b1d0ebeba113b641f9091cd048af26f4ffc4242 [2024-10-31 22:09:29,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:09:29,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:09:29,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:09:29,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:09:29,815 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:09:29,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i Unable to find full path for "g++" [2024-10-31 22:09:32,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:09:32,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:09:32,371 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i [2024-10-31 22:09:32,388 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data/c2810b26e/da21668657e945a0bd3df81a65667801/FLAGa3618388a [2024-10-31 22:09:32,406 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/data/c2810b26e/da21668657e945a0bd3df81a65667801 [2024-10-31 22:09:32,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:09:32,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:09:32,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:32,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:09:32,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:09:32,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:32,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38eef61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32, skipping insertion in model container [2024-10-31 22:09:32,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:32,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:09:32,659 WARN L251 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_a1094d5f-8c00-4987-b924-186a9a6086a3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i[915,928] [2024-10-31 22:09:32,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:32,768 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:09:32,788 WARN L251 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_a1094d5f-8c00-4987-b924-186a9a6086a3/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-30.i[915,928] [2024-10-31 22:09:32,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:32,902 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:09:32,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32 WrapperNode [2024-10-31 22:09:32,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:32,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:32,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:09:32,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:09:32,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:32,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:32,975 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-31 22:09:32,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:32,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:09:32,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:09:32,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:09:32,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:32,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:32,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,016 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:09:33,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:09:33,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:09:33,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:09:33,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:09:33,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (1/1) ... [2024-10-31 22:09:33,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:33,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:09:33,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:09:33,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:09:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:09:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:09:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:09:33,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:09:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:09:33,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:09:33,232 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:09:33,234 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:09:45,051 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-31 22:09:45,051 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:09:45,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:09:45,071 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:09:45,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:45 BoogieIcfgContainer [2024-10-31 22:09:45,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:09:45,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:09:45,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:09:45,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:09:45,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:09:32" (1/3) ... [2024-10-31 22:09:45,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d96324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:45, skipping insertion in model container [2024-10-31 22:09:45,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:32" (2/3) ... [2024-10-31 22:09:45,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d96324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:45, skipping insertion in model container [2024-10-31 22:09:45,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:45" (3/3) ... [2024-10-31 22:09:45,091 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-30.i [2024-10-31 22:09:45,112 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:09:45,112 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:09:45,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:09:45,203 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d738d39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:09:45,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:09:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:09:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:09:45,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:45,222 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:45,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:45,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash 8599864, now seen corresponding path program 1 times [2024-10-31 22:09:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:09:45,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312946103] [2024-10-31 22:09:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:45,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:09:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:09:45,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:09:45,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:09:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:45,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:09:45,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:09:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-31 22:09:45,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:09:45,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:09:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312946103] [2024-10-31 22:09:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312946103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:09:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588629284] [2024-10-31 22:09:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:45,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:09:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:09:45,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:09:45,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:09:45,872 INFO L87 Difference]: Start difference. First operand has 51 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:09:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:45,905 INFO L93 Difference]: Finished difference Result 95 states and 156 transitions. [2024-10-31 22:09:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:09:45,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2024-10-31 22:09:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:45,915 INFO L225 Difference]: With dead ends: 95 [2024-10-31 22:09:45,916 INFO L226 Difference]: Without dead ends: 47 [2024-10-31 22:09:45,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:09:45,925 INFO L432 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:45,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:09:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-31 22:09:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-31 22:09:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-31 22:09:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2024-10-31 22:09:45,987 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 75 [2024-10-31 22:09:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:45,988 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2024-10-31 22:09:45,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-31 22:09:45,989 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2024-10-31 22:09:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:09:45,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:45,995 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:46,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:09:46,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:09:46,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -657445248, now seen corresponding path program 1 times [2024-10-31 22:09:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:09:46,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399042028] [2024-10-31 22:09:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:09:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:09:46,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:09:46,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1094d5f-8c00-4987-b924-186a9a6086a3/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:09:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:46,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:09:46,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:09:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-31 22:09:47,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:09:47,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:09:47,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399042028] [2024-10-31 22:09:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399042028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:47,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:47,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:09:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070839187] [2024-10-31 22:09:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:47,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:09:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:09:47,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:09:47,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:09:47,558 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-31 22:09:51,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []