./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:53,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:53,793 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:53,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:53,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:53,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:53,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:53,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:53,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:53,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:53,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:53,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:53,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:53,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:53,833 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:53,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:53,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:53,834 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:53,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:53,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:53,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:53,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:53,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:53,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:53,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:53,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:53,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:53,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:53,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:53,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:53,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:53,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:53,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:53,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:53,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:53,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:53,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:53,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:53,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:53,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:53,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:53,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:53,852 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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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 -> 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba [2024-10-31 21:57:54,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:54,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:54,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:54,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:54,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:54,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i Unable to find full path for "g++" [2024-10-31 21:57:56,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:56,711 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:56,712 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2024-10-31 21:57:56,722 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data/a1c8607c4/e86b3989b2ec490f9270134d93ae3ca6/FLAG4b737c457 [2024-10-31 21:57:57,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data/a1c8607c4/e86b3989b2ec490f9270134d93ae3ca6 [2024-10-31 21:57:57,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:57,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:57,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:57,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:57,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:57,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3287bf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57, skipping insertion in model container [2024-10-31 21:57:57,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:57,418 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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2024-10-31 21:57:57,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:57,507 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:57,519 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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2024-10-31 21:57:57,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:57,562 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:57,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57 WrapperNode [2024-10-31 21:57:57,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:57,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:57,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:57,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:57,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,638 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-31 21:57:57,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:57,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:57,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:57,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:57,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,675 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 21:57:57,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:57,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:57,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:57,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:57,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (1/1) ... [2024-10-31 21:57:57,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:57,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:57,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:57,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:57,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:57,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:57,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:57,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:57,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:57,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:57,883 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:57,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:58,220 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:58,220 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:58,238 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:58,238 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:58,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:58 BoogieIcfgContainer [2024-10-31 21:57:58,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:58,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:58,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:58,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:58,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:57" (1/3) ... [2024-10-31 21:57:58,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36813620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:58, skipping insertion in model container [2024-10-31 21:57:58,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:57" (2/3) ... [2024-10-31 21:57:58,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36813620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:58, skipping insertion in model container [2024-10-31 21:57:58,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:58" (3/3) ... [2024-10-31 21:57:58,249 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-71.i [2024-10-31 21:57:58,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:58,281 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:58,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:58,373 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;@2b90f991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:58,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 21:57:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-31 21:57:58,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:58,391 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:58,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1522757036, now seen corresponding path program 1 times [2024-10-31 21:57:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689224854] [2024-10-31 21:57:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 21:57:58,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689224854] [2024-10-31 21:57:58,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689224854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:58,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:58,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:58,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940922755] [2024-10-31 21:57:58,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:58,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:58,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:58,960 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 21:57:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:59,019 INFO L93 Difference]: Finished difference Result 105 states and 171 transitions. [2024-10-31 21:57:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:59,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-10-31 21:57:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:59,051 INFO L225 Difference]: With dead ends: 105 [2024-10-31 21:57:59,052 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 21:57:59,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 21:57:59,069 INFO L432 NwaCegarLoop]: 74 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, 74 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 21:57:59,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 21:57:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 21:57:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 21:57:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-31 21:57:59,158 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 99 [2024-10-31 21:57:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:59,159 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-31 21:57:59,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 21:57:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-10-31 21:57:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-31 21:57:59,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:59,165 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:59,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:59,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:59,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash 890589326, now seen corresponding path program 1 times [2024-10-31 21:57:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841751229] [2024-10-31 21:57:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:57:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:57:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:57:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:57:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:57:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:57:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:57:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:57:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 21:57:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841751229] [2024-10-31 21:57:59,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841751229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:59,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:59,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:59,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085644301] [2024-10-31 21:57:59,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:59,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:59,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:59,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:59,874 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 21:58:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:00,032 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-10-31 21:58:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:58:00,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-10-31 21:58:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:00,035 INFO L225 Difference]: With dead ends: 106 [2024-10-31 21:58:00,035 INFO L226 Difference]: Without dead ends: 57 [2024-10-31 21:58:00,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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 21:58:00,038 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:00,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:58:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-31 21:58:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-31 21:58:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 21:58:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-10-31 21:58:00,053 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 99 [2024-10-31 21:58:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:00,054 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-10-31 21:58:00,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 21:58:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-10-31 21:58:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-31 21:58:00,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:00,058 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:00,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:58:00,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:00,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:00,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1510762366, now seen corresponding path program 1 times [2024-10-31 21:58:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596933799] [2024-10-31 21:58:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:58:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:58:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 21:58:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:00,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596933799] [2024-10-31 21:58:00,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596933799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:00,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:58:00,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017550366] [2024-10-31 21:58:00,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:00,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:58:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:00,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:58:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:58:00,947 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 21:58:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:01,194 INFO L93 Difference]: Finished difference Result 130 states and 177 transitions. [2024-10-31 21:58:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:58:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-10-31 21:58:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:01,199 INFO L225 Difference]: With dead ends: 130 [2024-10-31 21:58:01,199 INFO L226 Difference]: Without dead ends: 76 [2024-10-31 21:58:01,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:58:01,203 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:01,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:58:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-31 21:58:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2024-10-31 21:58:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 21:58:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-10-31 21:58:01,215 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 100 [2024-10-31 21:58:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:01,216 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-10-31 21:58:01,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 21:58:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-10-31 21:58:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-31 21:58:01,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:01,218 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:01,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:58:01,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:01,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:01,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1088541946, now seen corresponding path program 1 times [2024-10-31 21:58:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:01,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172300595] [2024-10-31 21:58:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:58:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:58:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 21:58:01,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172300595] [2024-10-31 21:58:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172300595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:01,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:58:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281925453] [2024-10-31 21:58:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:01,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:58:01,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:58:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:58:01,805 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 21:58:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:01,970 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2024-10-31 21:58:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:58:01,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-10-31 21:58:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:01,975 INFO L225 Difference]: With dead ends: 157 [2024-10-31 21:58:01,975 INFO L226 Difference]: Without dead ends: 95 [2024-10-31 21:58:01,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:58:01,980 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 43 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:01,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 310 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:58:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-31 21:58:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 65. [2024-10-31 21:58:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 21:58:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-10-31 21:58:02,001 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 101 [2024-10-31 21:58:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:02,002 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-10-31 21:58:02,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 21:58:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-10-31 21:58:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-31 21:58:02,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:02,008 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:02,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:58:02,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:02,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash -692144035, now seen corresponding path program 1 times [2024-10-31 21:58:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193661261] [2024-10-31 21:58:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:02,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:58:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:02,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:58:02,158 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:58:02,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:58:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:58:02,166 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-31 21:58:02,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:58:02,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:58:02 BoogieIcfgContainer [2024-10-31 21:58:02,252 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:58:02,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:58:02,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:58:02,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:58:02,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:58" (3/4) ... [2024-10-31 21:58:02,262 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:58:02,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:58:02,266 INFO L158 Benchmark]: Toolchain (without parser) took 5222.10ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 93.6MB in the beginning and 102.7MB in the end (delta: -9.1MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-10-31 21:58:02,267 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 132.1MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:58:02,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.55ms. Allocated memory is still 132.1MB. Free memory was 93.6MB in the beginning and 78.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 21:58:02,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.85ms. Allocated memory is still 132.1MB. Free memory was 78.9MB in the beginning and 76.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:58:02,268 INFO L158 Benchmark]: Boogie Preprocessor took 53.79ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 72.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:58:02,268 INFO L158 Benchmark]: RCFGBuilder took 545.04ms. Allocated memory is still 132.1MB. Free memory was 72.1MB in the beginning and 54.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 21:58:02,268 INFO L158 Benchmark]: TraceAbstraction took 4010.99ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 53.3MB in the beginning and 102.7MB in the end (delta: -49.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:58:02,269 INFO L158 Benchmark]: Witness Printer took 6.59ms. Allocated memory is still 169.9MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:58:02,272 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.35ms. Allocated memory is still 132.1MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.55ms. Allocated memory is still 132.1MB. Free memory was 93.6MB in the beginning and 78.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.85ms. Allocated memory is still 132.1MB. Free memory was 78.9MB in the beginning and 76.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.79ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 72.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 545.04ms. Allocated memory is still 132.1MB. Free memory was 72.1MB in the beginning and 54.2MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4010.99ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 53.3MB in the beginning and 102.7MB in the end (delta: -49.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.59ms. Allocated memory is still 169.9MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] float var_1_8 = 1.8; [L30] float var_1_9 = 9999999999999.75; [L31] float var_1_10 = 8.75; [L32] float var_1_11 = 255.75; [L33] unsigned short int var_1_12 = 10; [L34] unsigned char var_1_13 = 2; [L35] unsigned short int var_1_14 = 4; VAL [isInitial=0, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=0, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_8=9/5, var_1_9=39999999999999/4] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L85] var_1_9 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L86] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L87] var_1_10 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L88] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L89] var_1_11 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L90] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L103] RET updateVariables() [L104] CALL step() [L39] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L53] var_1_12 = 100 [L54] var_1_13 = var_1_3 [L55] var_1_14 = var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1, var_1_8=9/5] [L56] COND TRUE (var_1_13 >> var_1_3) <= var_1_5 [L57] COND TRUE (25 > var_1_13) && var_1_7 [L58] var_1_8 = (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))) VAL [isInitial=1, stepLocal_0=-255, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L95] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L95-L96] return ((((var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9)))) && (var_1_12 == ((unsigned short int) 100))) && (var_1_13 == ((unsigned char) var_1_3))) && (var_1_14 == ((unsigned short int) var_1_3)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] [L19] reach_error() VAL [isInitial=1, var_1_12=100, var_1_13=0, var_1_14=0, var_1_1=51, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=51, var_1_6=-255, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 715 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 414 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 301 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 1040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1680/1680 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 21:58:02,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:04,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:04,836 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 21:58:04,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:04,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:04,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:04,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:04,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:04,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:58:04,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:58:04,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:04,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:04,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:04,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:04,889 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:04,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:04,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:04,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:04,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:04,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:04,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:04,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:04,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:04,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:58:04,898 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 21:58:04,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:04,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 21:58:04,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:04,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:04,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:04,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:04,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:04,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:58:04,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:04,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:04,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:04,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:04,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:04,906 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 21:58:04,906 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 21:58:04,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:04,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:04,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:04,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:04,908 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 21:58:04,908 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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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 -> 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba [2024-10-31 21:58:05,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:05,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:05,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:05,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:05,355 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:05,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i Unable to find full path for "g++" [2024-10-31 21:58:07,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:07,775 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:07,777 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2024-10-31 21:58:07,791 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data/fca1d77a4/fe8b0fcf44604439acf0809b4055bb15/FLAG52aff51ae [2024-10-31 21:58:07,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/data/fca1d77a4/fe8b0fcf44604439acf0809b4055bb15 [2024-10-31 21:58:07,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:07,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:07,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:07,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:07,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:07,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:07" (1/1) ... [2024-10-31 21:58:07,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e9c24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:07, skipping insertion in model container [2024-10-31 21:58:07,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:07" (1/1) ... [2024-10-31 21:58:07,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:08,096 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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2024-10-31 21:58:08,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:08,183 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:08,201 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_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2024-10-31 21:58:08,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:08,325 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:08,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08 WrapperNode [2024-10-31 21:58:08,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:08,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:08,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:08,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:08,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,391 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-31 21:58:08,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:08,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:08,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:08,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:08,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,439 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 21:58:08,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:08,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:08,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:08,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:08,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (1/1) ... [2024-10-31 21:58:08,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:08,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:58:08,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:58:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 21:58:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:58:08,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:58:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:08,664 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:08,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:09,273 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-31 21:58:09,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:09,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:09,294 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:58:09,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:09 BoogieIcfgContainer [2024-10-31 21:58:09,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:09,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:09,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:09,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:09,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:07" (1/3) ... [2024-10-31 21:58:09,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25641248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:09, skipping insertion in model container [2024-10-31 21:58:09,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:08" (2/3) ... [2024-10-31 21:58:09,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25641248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:09, skipping insertion in model container [2024-10-31 21:58:09,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:09" (3/3) ... [2024-10-31 21:58:09,305 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-71.i [2024-10-31 21:58:09,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:09,337 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:58:09,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:09,425 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;@6eaace15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:09,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:58:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 21:58:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-31 21:58:09,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:09,440 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:09,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:09,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1106668664, now seen corresponding path program 1 times [2024-10-31 21:58:09,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:58:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022090839] [2024-10-31 21:58:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:09,460 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 21:58:09,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:58:09,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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 21:58:09,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48426e92-8d35-43c8-b9e5-3fe990e4e3a0/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 21:58:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:09,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-31 21:58:09,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:58:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-31 21:58:11,634 INFO L311 TraceCheckSpWp]: Computing backward predicates...