./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.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_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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_38bfa6ec-b95b-462e-877f-67736f2aca1c/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 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:34,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:34,264 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:58:34,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:34,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:34,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:34,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:34,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:34,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:58:34,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:58:34,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:34,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:34,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:34,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:34,312 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:34,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:34,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:34,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:34,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:58:34,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:34,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:34,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:34,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:34,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:34,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:34,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:34,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:34,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:34,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:34,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:34,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:58:34,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:34,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:34,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:34,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:34,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:34,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:58:34,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:58:34,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:34,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:34,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:34,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:34,326 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_38bfa6ec-b95b-462e-877f-67736f2aca1c/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_38bfa6ec-b95b-462e-877f-67736f2aca1c/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 -> 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 [2024-10-31 21:58:34,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:34,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:34,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:34,681 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:34,682 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:34,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i Unable to find full path for "g++" [2024-10-31 21:58:36,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:36,944 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:36,945 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-31 21:58:36,953 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data/066771456/f55081cce1f9411a85f9c5aba5e10364/FLAG8c3f4d3d9 [2024-10-31 21:58:36,971 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data/066771456/f55081cce1f9411a85f9c5aba5e10364 [2024-10-31 21:58:36,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:36,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:36,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:36,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:36,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:36,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:36" (1/1) ... [2024-10-31 21:58:36,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a527b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:36, skipping insertion in model container [2024-10-31 21:58:36,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:36" (1/1) ... [2024-10-31 21:58:37,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:37,236 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_38bfa6ec-b95b-462e-877f-67736f2aca1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-31 21:58:37,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:37,297 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:37,311 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_38bfa6ec-b95b-462e-877f-67736f2aca1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-31 21:58:37,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:37,354 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:37,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37 WrapperNode [2024-10-31 21:58:37,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:37,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:37,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:37,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:37,365 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:37" (1/1) ... [2024-10-31 21:58:37,379 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:37" (1/1) ... [2024-10-31 21:58:37,414 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-31 21:58:37,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:37,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:37,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:37,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:37,428 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:37" (1/1) ... [2024-10-31 21:58:37,429 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:37" (1/1) ... [2024-10-31 21:58:37,432 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:37" (1/1) ... [2024-10-31 21:58:37,454 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:37,454 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:37" (1/1) ... [2024-10-31 21:58:37,454 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:37" (1/1) ... [2024-10-31 21:58:37,459 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:37" (1/1) ... [2024-10-31 21:58:37,470 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:37" (1/1) ... [2024-10-31 21:58:37,471 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:37" (1/1) ... [2024-10-31 21:58:37,477 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:37" (1/1) ... [2024-10-31 21:58:37,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:37,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:37,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:37,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:37,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (1/1) ... [2024-10-31 21:58:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:37,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:37,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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:37,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:37,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:58:37,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:58:37,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:58:37,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:37,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:37,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:37,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:37,953 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-31 21:58:37,953 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:37,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:37,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:58:37,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:37 BoogieIcfgContainer [2024-10-31 21:58:37,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:37,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:37,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:37,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:37,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:36" (1/3) ... [2024-10-31 21:58:37,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4ec031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:37, skipping insertion in model container [2024-10-31 21:58:37,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:37" (2/3) ... [2024-10-31 21:58:37,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4ec031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:37, skipping insertion in model container [2024-10-31 21:58:37,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:37" (3/3) ... [2024-10-31 21:58:37,980 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-31 21:58:37,997 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:37,997 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:58:38,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:38,119 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;@5ee2c547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:38,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:58:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:58:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 21:58:38,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:38,144 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:38,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:38,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1637717661, now seen corresponding path program 1 times [2024-10-31 21:58:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:38,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948305889] [2024-10-31 21:58:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:58:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:38,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948305889] [2024-10-31 21:58:38,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948305889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:38,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:38,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654307086] [2024-10-31 21:58:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:38,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:58:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:38,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:58:38,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:58:38,689 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:58:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:38,726 INFO L93 Difference]: Finished difference Result 109 states and 182 transitions. [2024-10-31 21:58:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:58:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2024-10-31 21:58:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:38,742 INFO L225 Difference]: With dead ends: 109 [2024-10-31 21:58:38,743 INFO L226 Difference]: Without dead ends: 54 [2024-10-31 21:58:38,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:58:38,752 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:38,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:58:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-31 21:58:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-31 21:58:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:58:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-10-31 21:58:38,817 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 105 [2024-10-31 21:58:38,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:38,818 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-10-31 21:58:38,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:58:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-10-31 21:58:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 21:58:38,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:38,827 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:58:38,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:38,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash 127579805, now seen corresponding path program 1 times [2024-10-31 21:58:38,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:38,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907001710] [2024-10-31 21:58:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:58:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:39,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907001710] [2024-10-31 21:58:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907001710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:39,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:39,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:58:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957717739] [2024-10-31 21:58:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:39,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:39,398 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:39,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:39,461 INFO L93 Difference]: Finished difference Result 106 states and 157 transitions. [2024-10-31 21:58:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-31 21:58:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:39,464 INFO L225 Difference]: With dead ends: 106 [2024-10-31 21:58:39,464 INFO L226 Difference]: Without dead ends: 55 [2024-10-31 21:58:39,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:39,467 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:39,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:58:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-31 21:58:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-31 21:58:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:58:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2024-10-31 21:58:39,479 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 105 [2024-10-31 21:58:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:39,481 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-10-31 21:58:39,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2024-10-31 21:58:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 21:58:39,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:39,485 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:58:39,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:39,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 828644383, now seen corresponding path program 1 times [2024-10-31 21:58:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:39,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108800605] [2024-10-31 21:58:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:58:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108800605] [2024-10-31 21:58:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108800605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:39,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:39,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:58:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838293982] [2024-10-31 21:58:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:39,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:58:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:58:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:58:39,915 INFO L87 Difference]: Start difference. First operand 55 states and 80 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:40,127 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2024-10-31 21:58:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:58:40,128 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-31 21:58:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:40,131 INFO L225 Difference]: With dead ends: 159 [2024-10-31 21:58:40,133 INFO L226 Difference]: Without dead ends: 107 [2024-10-31 21:58:40,134 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:40,137 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:40,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:58:40,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-31 21:58:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2024-10-31 21:58:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-31 21:58:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-10-31 21:58:40,180 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 105 [2024-10-31 21:58:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:40,181 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-10-31 21:58:40,181 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-10-31 21:58:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-31 21:58:40,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:40,183 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:58:40,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:40,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash -46810809, now seen corresponding path program 1 times [2024-10-31 21:58:40,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:40,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925146952] [2024-10-31 21:58:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:58:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:40,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925146952] [2024-10-31 21:58:40,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925146952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:40,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:40,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:58:40,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11262234] [2024-10-31 21:58:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:40,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:58:40,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:58:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:58:40,639 INFO L87 Difference]: Start difference. First operand 98 states and 146 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:41,010 INFO L93 Difference]: Finished difference Result 265 states and 394 transitions. [2024-10-31 21:58:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:58:41,011 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-31 21:58:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:41,013 INFO L225 Difference]: With dead ends: 265 [2024-10-31 21:58:41,016 INFO L226 Difference]: Without dead ends: 213 [2024-10-31 21:58:41,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:58:41,019 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 136 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:41,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 422 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:58:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-31 21:58:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 112. [2024-10-31 21:58:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-31 21:58:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 168 transitions. [2024-10-31 21:58:41,056 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 168 transitions. Word has length 106 [2024-10-31 21:58:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:41,057 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 168 transitions. [2024-10-31 21:58:41,058 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 168 transitions. [2024-10-31 21:58:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-31 21:58:41,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:41,060 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:58:41,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:41,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1264021694, now seen corresponding path program 1 times [2024-10-31 21:58:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389845732] [2024-10-31 21:58:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:58:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389845732] [2024-10-31 21:58:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389845732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:58:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150437430] [2024-10-31 21:58:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:58:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:58:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:58:42,097 INFO L87 Difference]: Start difference. First operand 112 states and 168 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:42,543 INFO L93 Difference]: Finished difference Result 257 states and 373 transitions. [2024-10-31 21:58:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:58:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-31 21:58:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:42,546 INFO L225 Difference]: With dead ends: 257 [2024-10-31 21:58:42,546 INFO L226 Difference]: Without dead ends: 198 [2024-10-31 21:58:42,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:58:42,548 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 118 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:42,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 378 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 21:58:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-31 21:58:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 158. [2024-10-31 21:58:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 108 states have internal predecessors, (138), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 21:58:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-10-31 21:58:42,576 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 107 [2024-10-31 21:58:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:42,576 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-10-31 21:58:42,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-10-31 21:58:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-31 21:58:42,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:42,579 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:58:42,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:42,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:42,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1241283900, now seen corresponding path program 1 times [2024-10-31 21:58:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710005958] [2024-10-31 21:58:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 21:58:42,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:42,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710005958] [2024-10-31 21:58:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710005958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:42,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:42,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:58:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734707830] [2024-10-31 21:58:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:42,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:42,877 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:42,900 INFO L93 Difference]: Finished difference Result 252 states and 363 transitions. [2024-10-31 21:58:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:42,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-31 21:58:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:42,904 INFO L225 Difference]: With dead ends: 252 [2024-10-31 21:58:42,905 INFO L226 Difference]: Without dead ends: 142 [2024-10-31 21:58:42,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:42,907 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:42,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:58:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-31 21:58:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-31 21:58:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.164835164835165) internal successors, (106), 92 states have internal predecessors, (106), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-31 21:58:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2024-10-31 21:58:42,931 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 108 [2024-10-31 21:58:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:42,932 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2024-10-31 21:58:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 21:58:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2024-10-31 21:58:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 21:58:42,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:42,935 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:58:42,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1079678448, now seen corresponding path program 1 times [2024-10-31 21:58:42,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363506161] [2024-10-31 21:58:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:42,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:58:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:43,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:58:43,060 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:58:43,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 21:58:43,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:58:43,066 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:43,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:58:43,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:58:43 BoogieIcfgContainer [2024-10-31 21:58:43,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:58:43,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:58:43,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:58:43,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:58:43,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:37" (3/4) ... [2024-10-31 21:58:43,162 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:58:43,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:58:43,164 INFO L158 Benchmark]: Toolchain (without parser) took 6190.06ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 96.3MB in the beginning and 79.7MB in the end (delta: 16.6MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-10-31 21:58:43,165 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 134.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:58:43,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.55ms. Allocated memory is still 134.2MB. Free memory was 96.3MB in the beginning and 82.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 21:58:43,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.54ms. Allocated memory is still 134.2MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:58:43,166 INFO L158 Benchmark]: Boogie Preprocessor took 67.10ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 77.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:58:43,169 INFO L158 Benchmark]: RCFGBuilder took 487.31ms. Allocated memory is still 134.2MB. Free memory was 77.4MB in the beginning and 60.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 21:58:43,169 INFO L158 Benchmark]: TraceAbstraction took 5183.53ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 60.2MB in the beginning and 79.7MB in the end (delta: -19.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-10-31 21:58:43,170 INFO L158 Benchmark]: Witness Printer took 6.82ms. Allocated memory is still 163.6MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:58:43,171 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.36ms. Allocated memory is still 134.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.55ms. Allocated memory is still 134.2MB. Free memory was 96.3MB in the beginning and 82.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.54ms. Allocated memory is still 134.2MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.10ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 77.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.31ms. Allocated memory is still 134.2MB. Free memory was 77.4MB in the beginning and 60.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5183.53ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 60.2MB in the beginning and 79.7MB in the end (delta: -19.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Witness Printer took 6.82ms. Allocated memory is still 163.6MB. Free memory is still 79.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 to_int at line 100, overapproximation of shiftRight at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] signed long int var_1_3 = 999999999; [L24] unsigned char var_1_4 = 0; [L25] signed long int var_1_5 = 4; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_9 = 1; [L28] signed long int var_1_10 = 64; [L29] signed long int var_1_11 = 9; [L30] signed long int var_1_12 = 199; [L31] signed long int var_1_13 = 3; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_16 = 2; [L34] unsigned char last_1_var_1_14 = 1; VAL [isInitial=0, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=999999999, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=999999999, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L71] var_1_3 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L72] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_7=1, var_1_9=1] [L74] var_1_4 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_5=4, var_1_7=1, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=4, var_1_7=1, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=9, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L83] var_1_11 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=199, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L89] var_1_13 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L90] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=2, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L108] RET updateVariables() [L109] CALL step() [L38] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L38] COND TRUE (last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14) [L39] var_1_7 = (var_1_4 || var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=1, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L41] COND FALSE !(var_1_13 == (- var_1_12)) [L48] var_1_14 = 0 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=64, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L50] COND TRUE var_1_5 > var_1_3 [L51] var_1_10 = 4.6 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L55] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_14=1, stepLocal_0=0, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=1, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L56] COND FALSE !(stepLocal_0 && var_1_7) [L67] var_1_1 = var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L100-L101] return (((((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1)) && ((var_1_5 > var_1_3) ? (var_1_10 == ((signed long int) 4.6)) : (var_1_10 == ((signed long int) ((((var_1_11) > (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11) : (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))))))))) && ((var_1_13 == (- var_1_12)) ? ((var_1_7 && var_1_7) ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_16))) : (var_1_14 == ((unsigned char) 0))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=1000000000, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, var_1_10=1000000000, var_1_11=-1, var_1_12=-2, var_1_13=-3, var_1_14=0, var_1_16=254, var_1_1=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 1365 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 674 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 150 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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:43,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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_38bfa6ec-b95b-462e-877f-67736f2aca1c/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 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:45,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:45,766 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 21:58:45,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:45,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:45,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:45,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:45,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:45,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:58:45,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:58:45,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:45,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:45,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:45,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:45,817 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:45,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:45,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:45,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:45,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:45,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:45,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:45,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:45,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:45,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:58:45,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 21:58:45,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:45,827 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 21:58:45,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:45,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:45,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:45,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:45,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:45,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:58:45,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:45,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:45,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:45,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:45,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:45,832 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 21:58:45,832 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 21:58:45,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:45,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:45,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:45,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:45,833 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 21:58:45,833 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_38bfa6ec-b95b-462e-877f-67736f2aca1c/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_38bfa6ec-b95b-462e-877f-67736f2aca1c/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 -> 8d6e232da9a83d5f71424a24404b69fd0e4337eea9ca06f51ad2ecca1f048cf0 [2024-10-31 21:58:46,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:46,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:46,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:46,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:46,256 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:46,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i Unable to find full path for "g++" [2024-10-31 21:58:48,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:48,603 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:48,604 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-31 21:58:48,614 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data/6cea9b8c4/3a5d11cb07a64b3dae8c4b169a5f28b7/FLAG2a49e4a6c [2024-10-31 21:58:48,634 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/data/6cea9b8c4/3a5d11cb07a64b3dae8c4b169a5f28b7 [2024-10-31 21:58:48,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:48,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:48,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:48,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:48,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:48,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:48" (1/1) ... [2024-10-31 21:58:48,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@412c16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:48, skipping insertion in model container [2024-10-31 21:58:48,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:48" (1/1) ... [2024-10-31 21:58:48,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:48,953 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_38bfa6ec-b95b-462e-877f-67736f2aca1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-31 21:58:49,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:49,043 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:49,056 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_38bfa6ec-b95b-462e-877f-67736f2aca1c/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-36.i[916,929] [2024-10-31 21:58:49,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:49,124 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:49,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:49 WrapperNode [2024-10-31 21:58:49,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:49,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:49,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:49,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:49,135 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:49" (1/1) ... [2024-10-31 21:58:49,149 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:49" (1/1) ... [2024-10-31 21:58:49,186 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-31 21:58:49,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:49,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:49,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:49,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:49,205 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:49" (1/1) ... [2024-10-31 21:58:49,205 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:49" (1/1) ... [2024-10-31 21:58:49,208 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:49" (1/1) ... [2024-10-31 21:58:49,232 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:49,232 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:49" (1/1) ... [2024-10-31 21:58:49,233 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:49" (1/1) ... [2024-10-31 21:58:49,241 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:49" (1/1) ... [2024-10-31 21:58:49,245 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:49" (1/1) ... [2024-10-31 21:58:49,249 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:49" (1/1) ... [2024-10-31 21:58:49,251 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:49" (1/1) ... [2024-10-31 21:58:49,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:49,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:49,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:49,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:49,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:49" (1/1) ... [2024-10-31 21:58:49,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:49,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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:49,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 21:58:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:58:49,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:58:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:49,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:49,450 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:49,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:49,808 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-31 21:58:49,808 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:49,829 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:49,829 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:58:49,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:49 BoogieIcfgContainer [2024-10-31 21:58:49,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:49,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:49,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:49,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:49,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:48" (1/3) ... [2024-10-31 21:58:49,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbd4ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:49, skipping insertion in model container [2024-10-31 21:58:49,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:49" (2/3) ... [2024-10-31 21:58:49,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbd4ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:49, skipping insertion in model container [2024-10-31 21:58:49,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:49" (3/3) ... [2024-10-31 21:58:49,842 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-36.i [2024-10-31 21:58:49,861 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:49,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:58:49,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:49,954 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;@55bf80e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:49,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:58:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:58:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-31 21:58:49,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:49,972 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1273255444, now seen corresponding path program 1 times [2024-10-31 21:58:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:58:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313277918] [2024-10-31 21:58:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:50,000 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:50,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:58:50,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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:50,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:50,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 21:58:50,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:58:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-31 21:58:50,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:58:50,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 21:58:50,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313277918] [2024-10-31 21:58:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313277918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:50,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:50,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827578049] [2024-10-31 21:58:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:50,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:58:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 21:58:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:58:50,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:58:50,393 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:58:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:50,435 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2024-10-31 21:58:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:58:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-10-31 21:58:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:50,451 INFO L225 Difference]: With dead ends: 95 [2024-10-31 21:58:50,451 INFO L226 Difference]: Without dead ends: 47 [2024-10-31 21:58:50,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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:58:50,461 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:50,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:58:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-31 21:58:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-31 21:58:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 21:58:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-10-31 21:58:50,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 102 [2024-10-31 21:58:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:50,536 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-10-31 21:58:50,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 21:58:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-10-31 21:58:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-31 21:58:50,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:50,541 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-31 21:58:50,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 21:58:50,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 881071126, now seen corresponding path program 1 times [2024-10-31 21:58:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 21:58:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62588561] [2024-10-31 21:58:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:50,754 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:50,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 21:58:50,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/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:50,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 21:58:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:50,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:58:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:58:51,003 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-31 21:58:51,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1452672358] [2024-10-31 21:58:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:51,004 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 21:58:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 [2024-10-31 21:58:51,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 21:58:51,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfa6ec-b95b-462e-877f-67736f2aca1c/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-31 21:58:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:51,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 21:58:51,413 INFO L278 TraceCheckSpWp]: Computing forward predicates...