./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f056be744fcae26accb2c049a9cf7a4321bd3ba6c0302870967f442303a6d9cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:01:16,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:01:16,460 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:01:16,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:01:16,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:01:16,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:01:16,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:01:16,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:01:16,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:01:16,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:01:16,492 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:01:16,492 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:01:16,493 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:01:16,493 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:01:16,494 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:01:16,494 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:01:16,495 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:01:16,495 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:01:16,495 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:01:16,496 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:01:16,496 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:01:16,498 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:01:16,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:01:16,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:01:16,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:01:16,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:01:16,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:01:16,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:01:16,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:01:16,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:01:16,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:01:16,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:01:16,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:01:16,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:01:16,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:01:16,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:01:16,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:01:16,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:01:16,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:01:16,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:01:16,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:01:16,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:01:16,515 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:01:16,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:01:16,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:01:16,516 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:01:16,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:01:16,516 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/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_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> f056be744fcae26accb2c049a9cf7a4321bd3ba6c0302870967f442303a6d9cc [2024-11-09 05:01:16,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:01:16,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:01:16,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:01:16,862 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:01:16,864 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:01:16,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c Unable to find full path for "g++" [2024-11-09 05:01:18,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:01:19,175 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:01:19,176 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/sv-benchmarks/c/floats-nonlinear/color-magicseries2.c [2024-11-09 05:01:19,185 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/data/73f072ffd/22dccdea1da04e8fbfbb335c9830b895/FLAG13a0a4c35 [2024-11-09 05:01:19,205 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/data/73f072ffd/22dccdea1da04e8fbfbb335c9830b895 [2024-11-09 05:01:19,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:01:19,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:01:19,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:01:19,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:01:19,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:01:19,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f98f495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19, skipping insertion in model container [2024-11-09 05:01:19,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:01:19,467 WARN L250 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_451afb38-1121-413d-b294-ff50ea280384/sv-benchmarks/c/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-09 05:01:19,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:01:19,502 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:01:19,515 WARN L250 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_451afb38-1121-413d-b294-ff50ea280384/sv-benchmarks/c/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-09 05:01:19,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:01:19,543 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:01:19,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19 WrapperNode [2024-11-09 05:01:19,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:01:19,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:01:19,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:01:19,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:01:19,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,583 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2024-11-09 05:01:19,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:01:19,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:01:19,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:01:19,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:01:19,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:01:19,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:01:19,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:01:19,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:01:19,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (1/1) ... [2024-11-09 05:01:19,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:01:19,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:19,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:01:19,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:01:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:01:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:01:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:01:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-09 05:01:19,679 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-09 05:01:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:01:19,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:01:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:01:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:01:19,752 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:01:19,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:01:19,996 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-09 05:01:19,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:01:20,082 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:01:20,082 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:01:20,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:01:20 BoogieIcfgContainer [2024-11-09 05:01:20,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:01:20,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:01:20,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:01:20,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:01:20,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:01:19" (1/3) ... [2024-11-09 05:01:20,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6855f39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:01:20, skipping insertion in model container [2024-11-09 05:01:20,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:19" (2/3) ... [2024-11-09 05:01:20,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6855f39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:01:20, skipping insertion in model container [2024-11-09 05:01:20,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:01:20" (3/3) ... [2024-11-09 05:01:20,097 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries2.c [2024-11-09 05:01:20,117 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:01:20,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:01:20,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:01:20,190 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=FINITE_AUTOMATA, 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;@175049e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:01:20,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:01:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:01:20,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:20,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:20,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:20,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1911987393, now seen corresponding path program 1 times [2024-11-09 05:01:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:20,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658451166] [2024-11-09 05:01:20,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:20,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:20,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658451166] [2024-11-09 05:01:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658451166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:20,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:01:20,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692698598] [2024-11-09 05:01:20,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:01:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:01:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:20,733 INFO L87 Difference]: Start difference. First operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:01:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:20,801 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2024-11-09 05:01:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:01:20,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 05:01:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:20,811 INFO L225 Difference]: With dead ends: 39 [2024-11-09 05:01:20,812 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:01:20,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:20,820 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:20,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:01:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:01:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-11-09 05:01:20,865 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2024-11-09 05:01:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:20,867 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-09 05:01:20,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:01:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2024-11-09 05:01:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:01:20,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:20,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:20,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:01:20,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:20,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1942952562, now seen corresponding path program 1 times [2024-11-09 05:01:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:20,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925634151] [2024-11-09 05:01:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:20,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:20,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925634151] [2024-11-09 05:01:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925634151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:20,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:01:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282290209] [2024-11-09 05:01:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:01:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:20,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:01:20,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:01:20,952 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:01:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:20,981 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2024-11-09 05:01:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:01:20,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 05:01:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:20,983 INFO L225 Difference]: With dead ends: 46 [2024-11-09 05:01:20,985 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:01:20,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 05:01:20,987 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 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-11-09 05:01:20,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:01:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:01:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-09 05:01:20,998 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 16 [2024-11-09 05:01:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:20,999 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-09 05:01:20,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:01:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-09 05:01:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:01:21,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:21,002 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:21,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:01:21,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1350059206, now seen corresponding path program 1 times [2024-11-09 05:01:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017008586] [2024-11-09 05:01:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:01:21,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017008586] [2024-11-09 05:01:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017008586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:21,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:21,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:01:21,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263412613] [2024-11-09 05:01:21,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:21,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:01:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:21,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:01:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:21,090 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:21,143 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-11-09 05:01:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:01:21,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-09 05:01:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:21,145 INFO L225 Difference]: With dead ends: 52 [2024-11-09 05:01:21,145 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:01:21,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:21,147 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:21,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:01:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:01:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-11-09 05:01:21,153 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 20 [2024-11-09 05:01:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:21,154 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-09 05:01:21,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:01:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-11-09 05:01:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:01:21,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:21,155 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:21,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:01:21,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1695157739, now seen corresponding path program 1 times [2024-11-09 05:01:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:21,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649154761] [2024-11-09 05:01:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:01:21,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:21,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649154761] [2024-11-09 05:01:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649154761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:21,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:01:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491085860] [2024-11-09 05:01:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:21,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:01:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:01:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:21,222 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:01:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:21,262 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-11-09 05:01:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:01:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-09 05:01:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:21,265 INFO L225 Difference]: With dead ends: 56 [2024-11-09 05:01:21,265 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:01:21,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:21,267 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:21,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:01:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:01:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-09 05:01:21,280 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 24 [2024-11-09 05:01:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:21,280 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-09 05:01:21,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:01:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-09 05:01:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:01:21,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:21,281 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:21,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:01:21,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:21,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash -783719969, now seen corresponding path program 1 times [2024-11-09 05:01:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621844284] [2024-11-09 05:01:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:21,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621844284] [2024-11-09 05:01:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621844284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:01:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559474382] [2024-11-09 05:01:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:01:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:01:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:01:21,524 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:21,574 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-09 05:01:21,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:01:21,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-11-09 05:01:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:21,576 INFO L225 Difference]: With dead ends: 36 [2024-11-09 05:01:21,577 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 05:01:21,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:01:21,579 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:21,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 05:01:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 05:01:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-09 05:01:21,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 28 [2024-11-09 05:01:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:21,593 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-09 05:01:21,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-09 05:01:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:01:21,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:21,594 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:21,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:01:21,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 422643723, now seen corresponding path program 1 times [2024-11-09 05:01:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486893534] [2024-11-09 05:01:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:21,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:21,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486893534] [2024-11-09 05:01:21,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486893534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:21,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:21,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:01:21,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580910647] [2024-11-09 05:01:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:21,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:01:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:01:21,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:01:21,677 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:21,717 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-11-09 05:01:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:01:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-09 05:01:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:21,721 INFO L225 Difference]: With dead ends: 45 [2024-11-09 05:01:21,721 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 05:01:21,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 05:01:21,723 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:21,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 05:01:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-11-09 05:01:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-09 05:01:21,740 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2024-11-09 05:01:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:21,740 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-09 05:01:21,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-09 05:01:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:01:21,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:21,742 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:21,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:01:21,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1300345308, now seen corresponding path program 1 times [2024-11-09 05:01:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523304824] [2024-11-09 05:01:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:21,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523304824] [2024-11-09 05:01:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523304824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:21,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:01:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302418249] [2024-11-09 05:01:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:21,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:01:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:01:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:01:21,812 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:21,874 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-09 05:01:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:01:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2024-11-09 05:01:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:21,879 INFO L225 Difference]: With dead ends: 48 [2024-11-09 05:01:21,879 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 05:01:21,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-09 05:01:21,880 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:21,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:01:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 05:01:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 05:01:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-09 05:01:21,889 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 34 [2024-11-09 05:01:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:21,889 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-09 05:01:21,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-09 05:01:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 05:01:21,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:21,891 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:21,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:01:21,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:21,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash 832416968, now seen corresponding path program 1 times [2024-11-09 05:01:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249930479] [2024-11-09 05:01:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:21,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249930479] [2024-11-09 05:01:21,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249930479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055987895] [2024-11-09 05:01:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:21,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:21,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:01:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:22,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:01:22,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:22,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055987895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1731432580] [2024-11-09 05:01:22,273 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 05:01:22,273 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:22,277 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:22,283 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:22,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:23,332 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain with input of size 11 for LOIs [2024-11-09 05:01:23,340 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:24,389 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_12| (Array Int Int)) (|v_ULTIMATE.start_check_sum_~#s~0#1.base_15| Int)) (= |c_#valid| (store |v_#valid_12| |v_ULTIMATE.start_check_sum_~#s~0#1.base_15| 0))) (not |c_ULTIMATE.start_solve_#t~short17#1|)) is different from true [2024-11-09 05:01:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1731432580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:01:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [4, 4, 4] total 24 [2024-11-09 05:01:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616626636] [2024-11-09 05:01:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:24,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:01:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:01:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=434, Unknown=1, NotChecked=42, Total=552 [2024-11-09 05:01:24,499 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:01:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:25,916 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-11-09 05:01:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 05:01:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-11-09 05:01:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:25,920 INFO L225 Difference]: With dead ends: 47 [2024-11-09 05:01:25,920 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 05:01:25,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=113, Invalid=760, Unknown=1, NotChecked=56, Total=930 [2024-11-09 05:01:25,921 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:25,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 147 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 1 Unknown, 65 Unchecked, 0.5s Time] [2024-11-09 05:01:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 05:01:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-11-09 05:01:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-09 05:01:25,940 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 36 [2024-11-09 05:01:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:25,941 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 05:01:25,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:01:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 05:01:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 05:01:25,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:25,946 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:25,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:26,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:26,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:26,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash -131169660, now seen corresponding path program 1 times [2024-11-09 05:01:26,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:26,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967876339] [2024-11-09 05:01:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:26,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:26,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967876339] [2024-11-09 05:01:26,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967876339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:26,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113758524] [2024-11-09 05:01:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:26,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:26,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:26,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:26,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:01:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:26,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:01:26,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:26,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:01:26,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113758524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:26,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732774542] [2024-11-09 05:01:26,372 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 05:01:26,372 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:26,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:26,373 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:26,373 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:26,993 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain with input of size 11 for LOIs [2024-11-09 05:01:26,997 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:27,000 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_check_sum_~#s~0#1.base_17| Int) (|v_#valid_15| (Array Int Int))) (= |c_#valid| (store |v_#valid_15| |v_ULTIMATE.start_check_sum_~#s~0#1.base_17| 0))) is different from true [2024-11-09 05:01:27,825 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1325#(exists ((|v_ULTIMATE.start_check_sum_~#s~0#1.base_17| Int) (|v_#valid_15| (Array Int Int))) (= (store |v_#valid_15| |v_ULTIMATE.start_check_sum_~#s~0#1.base_17| 0) |#valid|))' at error location [2024-11-09 05:01:27,825 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:01:27,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:01:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 05:01:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123537752] [2024-11-09 05:01:27,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:27,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:01:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:01:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=442, Unknown=1, NotChecked=42, Total=552 [2024-11-09 05:01:27,829 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:27,889 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2024-11-09 05:01:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:01:27,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2024-11-09 05:01:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:27,890 INFO L225 Difference]: With dead ends: 55 [2024-11-09 05:01:27,890 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 05:01:27,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=442, Unknown=1, NotChecked=42, Total=552 [2024-11-09 05:01:27,891 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:27,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 05:01:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 05:01:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 05:01:27,910 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 38 [2024-11-09 05:01:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:27,910 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 05:01:27,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-09 05:01:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 05:01:27,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:27,912 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:27,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:01:28,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:28,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash -347259536, now seen corresponding path program 2 times [2024-11-09 05:01:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079995534] [2024-11-09 05:01:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 05:01:28,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:01:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079995534] [2024-11-09 05:01:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079995534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731649972] [2024-11-09 05:01:28,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:01:28,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:28,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:28,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:28,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:01:28,278 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 05:01:28,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:28,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:01:28,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 05:01:28,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 05:01:28,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731649972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:28,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [817464674] [2024-11-09 05:01:28,388 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2024-11-09 05:01:28,388 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:01:28,388 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:01:28,388 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:01:28,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:01:29,040 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain with input of size 11 for LOIs [2024-11-09 05:01:29,044 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:01:29,047 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#valid_19| (Array Int Int)) (|v_ULTIMATE.start_check_sum_~#s~0#1.base_20| Int)) (= |c_#valid| (store |v_#valid_19| |v_ULTIMATE.start_check_sum_~#s~0#1.base_20| 0))) is different from true [2024-11-09 05:01:29,891 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1731#(exists ((|v_#valid_19| (Array Int Int)) (|v_ULTIMATE.start_check_sum_~#s~0#1.base_20| Int)) (= (store |v_#valid_19| |v_ULTIMATE.start_check_sum_~#s~0#1.base_20| 0) |#valid|))' at error location [2024-11-09 05:01:29,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:01:29,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:01:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 05:01:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032429303] [2024-11-09 05:01:29,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:29,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:01:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:01:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:01:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=439, Unknown=1, NotChecked=42, Total=552 [2024-11-09 05:01:29,893 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:29,980 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-11-09 05:01:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:01:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-09 05:01:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:29,984 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:01:29,984 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 05:01:29,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=439, Unknown=1, NotChecked=42, Total=552 [2024-11-09 05:01:29,985 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:29,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:01:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 05:01:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 05:01:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:01:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-09 05:01:30,008 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 44 [2024-11-09 05:01:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:30,009 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-09 05:01:30,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 05:01:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-09 05:01:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 05:01:30,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:30,011 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:30,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:30,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:30,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:01:30,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash -762218421, now seen corresponding path program 3 times [2024-11-09 05:01:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:01:30,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64023851] [2024-11-09 05:01:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:01:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:01:30,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:01:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:01:30,601 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:01:30,602 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:01:30,603 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 05:01:30,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:01:30,608 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:01:30,654 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:01:30,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:01:30 BoogieIcfgContainer [2024-11-09 05:01:30,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:01:30,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:01:30,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:01:30,659 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:01:30,659 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:01:20" (3/4) ... [2024-11-09 05:01:30,660 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 05:01:30,746 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 05:01:30,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:01:30,747 INFO L158 Benchmark]: Toolchain (without parser) took 11537.50ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 146.0MB in the beginning and 154.1MB in the end (delta: -8.1MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2024-11-09 05:01:30,747 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 132.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:01:30,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.49ms. Allocated memory is still 180.4MB. Free memory was 146.0MB in the beginning and 133.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 05:01:30,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.45ms. Allocated memory is still 180.4MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:01:30,748 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 180.4MB. Free memory was 131.0MB in the beginning and 129.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:01:30,748 INFO L158 Benchmark]: RCFGBuilder took 467.08ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 111.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 05:01:30,748 INFO L158 Benchmark]: TraceAbstraction took 10567.72ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 110.5MB in the beginning and 158.3MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:01:30,749 INFO L158 Benchmark]: Witness Printer took 87.90ms. Allocated memory is still 218.1MB. Free memory was 158.3MB in the beginning and 154.1MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 05:01:30,751 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.31ms. Allocated memory is still 132.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.49ms. Allocated memory is still 180.4MB. Free memory was 146.0MB in the beginning and 133.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.45ms. Allocated memory is still 180.4MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 180.4MB. Free memory was 131.0MB in the beginning and 129.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 467.08ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 111.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10567.72ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 110.5MB in the beginning and 158.3MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.90ms. Allocated memory is still 218.1MB. Free memory was 158.3MB in the beginning and 154.1MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L56] int x, y, z, w; [L57] x = __VERIFIER_nondet_int() [L58] y = __VERIFIER_nondet_int() [L59] z = __VERIFIER_nondet_int() [L60] w = __VERIFIER_nondet_int() [L61] CALL, EXPR solve(x, y, z, w) [L44] CALL, EXPR check_domain(s0) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; [L44] RET, EXPR check_domain(s0) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s1) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; [L44] RET, EXPR check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s2) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; [L44] RET, EXPR check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L45] CALL, EXPR check_domain(s3) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; [L45] RET, EXPR check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] COND TRUE check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L47] CALL, EXPR check_sum(s0, s1, s2, s3) [L33] int s[4] = {s0, s1, s2, s3}; [L34] int i = 0; VAL [i=0, s={5:0}] [L34] COND FALSE !(i < 4) VAL [i=0, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=0, j=0, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=0, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=1, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=0, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ [L36] j++ VAL [i=0, j=2, s={5:0}, sum=1] [L36] COND FALSE !(j < 4) VAL [i=0, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=3, s={5:0}, sum=1] [L36] COND FALSE !(j < 4) VAL [i=0, j=3, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ [L36] j++ VAL [i=0, j=4, s={5:0}, sum=2] [L36] COND TRUE j < 4 VAL [i=0, s={5:0}, sum=2] [L38] EXPR s[i] VAL [i=0, s={5:0}, sum=2] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=1, s={5:0}] [L34] COND FALSE !(i < 4) VAL [i=1, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=1, j=0, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=1, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=2, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=3, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=4, s={5:0}, sum=0] [L36] COND TRUE j < 4 VAL [i=1, s={5:0}, sum=0] [L38] EXPR s[i] VAL [i=1, s={5:0}, sum=0] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=2, s={5:0}] [L34] COND FALSE !(i < 4) VAL [i=2, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=2, j=0, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=2, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ [L36] j++ VAL [i=2, j=1, s={5:0}, sum=1] [L36] COND FALSE !(j < 4) VAL [i=2, j=1, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=2, s={5:0}, sum=1] [L36] COND FALSE !(j < 4) VAL [i=2, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ [L36] j++ VAL [i=2, j=3, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=2, j=3, s={5:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=4, s={5:0}, sum=2] [L36] COND TRUE j < 4 VAL [i=2, s={5:0}, sum=2] [L38] EXPR s[i] VAL [i=2, s={5:0}, sum=2] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=3, s={5:0}] [L34] COND FALSE !(i < 4) VAL [i=3, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=3, j=0, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=1, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=2, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=3, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=4, s={5:0}, sum=0] [L36] COND TRUE j < 4 VAL [i=3, s={5:0}, sum=0] [L38] EXPR s[i] VAL [i=3, s={5:0}, sum=0] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=4, s={5:0}] [L34] COND TRUE i < 4 VAL [s={5:0}] [L40] return 1; [L33] int s[4] = {s0, s1, s2, s3}; [L40] return 1; VAL [\result=1] [L47] RET, EXPR check_sum(s0, s1, s2, s3) [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L46-L47] COND TRUE s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L48] return 1; VAL [\result=1] [L61] RET, EXPR solve(x, y, z, w) [L61] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 930 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 65 IncrementalHoareTripleChecker+Unchecked, 614 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 621 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 316 mSDtfsCounter, 621 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 287 SyntacticMatches, 22 SemanticMatches, 85 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=10, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 486 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 203/212 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: OVERALL_TIME: 1.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 33, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 31, TOOLS_POST_TIME: 0.4s, TOOLS_POST_CALL_APPLICATIONS: 12, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 51, TOOLS_QUANTIFIERELIM_TIME: 0.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 82, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 13, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 33, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 712, DAG_COMPRESSION_RETAINED_NODES: 79, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 05:01:30,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451afb38-1121-413d-b294-ff50ea280384/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE