./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-crafted/xor1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-crafted/xor1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 fa90627ffc045ef90595d49d60ca0f6095b53b667a9d0f028eb93e7bf4c6c579 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 12:11:07,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:11:07,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:11:07,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:11:07,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:11:07,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:11:07,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:11:07,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:11:07,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:11:07,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:11:07,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:11:07,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:11:07,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:11:07,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:11:07,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:11:07,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:11:07,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:11:07,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:11:07,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:11:07,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:11:07,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:11:07,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:11:07,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:11:07,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:11:07,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:11:07,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:11:07,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:11:07,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:11:07,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:11:07,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:11:07,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:11:07,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:11:07,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:11:07,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:11:07,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:11:07,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:11:07,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:11:07,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:11:07,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:11:07,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:11:07,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:11:07,093 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 12:11:07,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:11:07,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:11:07,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:11:07,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:11:07,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:11:07,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:11:07,120 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:11:07,120 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:11:07,120 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:11:07,121 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 12:11:07,121 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:11:07,121 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:11:07,121 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 12:11:07,121 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 12:11:07,121 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:11:07,122 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 12:11:07,122 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 12:11:07,122 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 12:11:07,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:11:07,123 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:11:07,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 12:11:07,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:11:07,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:11:07,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:11:07,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:11:07,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:11:07,124 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:11:07,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:11:07,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:11:07,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:11:07,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:11:07,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:11:07,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:11:07,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:11:07,125 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 12:11:07,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:11:07,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:11:07,126 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 12:11:07,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 12:11:07,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:11:07,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:11:07,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> fa90627ffc045ef90595d49d60ca0f6095b53b667a9d0f028eb93e7bf4c6c579 [2022-12-14 12:11:07,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:11:07,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:11:07,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:11:07,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:11:07,344 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:11:07,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/array-crafted/xor1.i [2022-12-14 12:11:09,872 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:11:10,015 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:11:10,015 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/sv-benchmarks/c/array-crafted/xor1.i [2022-12-14 12:11:10,019 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data/da017b603/a5a44d5d92d24386b16b28518c36c98e/FLAGcae3cd5e5 [2022-12-14 12:11:10,441 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data/da017b603/a5a44d5d92d24386b16b28518c36c98e [2022-12-14 12:11:10,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:11:10,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:11:10,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:11:10,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:11:10,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:11:10,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61155071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10, skipping insertion in model container [2022-12-14 12:11:10,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:11:10,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:11:10,574 WARN L237 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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/sv-benchmarks/c/array-crafted/xor1.i[1285,1298] [2022-12-14 12:11:10,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:11:10,583 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:11:10,597 WARN L237 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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/sv-benchmarks/c/array-crafted/xor1.i[1285,1298] [2022-12-14 12:11:10,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:11:10,607 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:11:10,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10 WrapperNode [2022-12-14 12:11:10,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:11:10,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:11:10,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:11:10,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:11:10,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,632 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2022-12-14 12:11:10,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:11:10,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:11:10,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:11:10,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:11:10,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,649 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:11:10,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:11:10,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:11:10,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:11:10,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (1/1) ... [2022-12-14 12:11:10,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:11:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:10,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:11:10,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:11:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:11:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 12:11:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 12:11:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 12:11:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:11:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:11:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 12:11:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-12-14 12:11:10,711 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-12-14 12:11:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 12:11:10,766 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:11:10,768 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:11:10,884 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:11:10,937 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:11:10,938 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 12:11:10,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:11:10 BoogieIcfgContainer [2022-12-14 12:11:10,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:11:10,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:11:10,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:11:10,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:11:10,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:11:10" (1/3) ... [2022-12-14 12:11:10,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58da7afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:11:10, skipping insertion in model container [2022-12-14 12:11:10,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:11:10" (2/3) ... [2022-12-14 12:11:10,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58da7afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:11:10, skipping insertion in model container [2022-12-14 12:11:10,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:11:10" (3/3) ... [2022-12-14 12:11:10,946 INFO L112 eAbstractionObserver]: Analyzing ICFG xor1.i [2022-12-14 12:11:10,960 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:11:10,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 12:11:10,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:11:10,999 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4efe2285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:11:10,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 12:11:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 12:11:11,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:11,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:11,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash -900110367, now seen corresponding path program 1 times [2022-12-14 12:11:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:11,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837929407] [2022-12-14 12:11:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:11,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 12:11:11,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837929407] [2022-12-14 12:11:11,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837929407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:11:11,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:11:11,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:11:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616671522] [2022-12-14 12:11:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:11:11,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:11:11,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:11,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:11:11,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:11:11,236 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:11:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:11,274 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-12-14 12:11:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:11:11,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-12-14 12:11:11,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:11,281 INFO L225 Difference]: With dead ends: 33 [2022-12-14 12:11:11,281 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 12:11:11,283 INFO L412 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 [2022-12-14 12:11:11,286 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:11,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 12:11:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-12-14 12:11:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-12-14 12:11:11,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 20 [2022-12-14 12:11:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:11,312 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-12-14 12:11:11,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:11:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-12-14 12:11:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 12:11:11,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:11,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:11,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 12:11:11,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -81331908, now seen corresponding path program 1 times [2022-12-14 12:11:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757941563] [2022-12-14 12:11:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 12:11:11,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:11,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757941563] [2022-12-14 12:11:11,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757941563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:11,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435006932] [2022-12-14 12:11:11,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:11,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:11,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:11,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:11,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 12:11:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:11,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:11:11,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:11:11,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:11:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435006932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:11:11,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:11:11,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 12:11:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883778902] [2022-12-14 12:11:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:11:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:11:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:11:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:11:11,503 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:11:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:11,522 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-12-14 12:11:11,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:11:11,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-12-14 12:11:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:11,523 INFO L225 Difference]: With dead ends: 29 [2022-12-14 12:11:11,524 INFO L226 Difference]: Without dead ends: 17 [2022-12-14 12:11:11,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:11:11,525 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:11,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-14 12:11:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-14 12:11:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-12-14 12:11:11,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 21 [2022-12-14 12:11:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:11,531 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-12-14 12:11:11,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:11:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-12-14 12:11:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 12:11:11,532 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:11,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:11,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:11:11,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:11,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:11,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash -813007823, now seen corresponding path program 1 times [2022-12-14 12:11:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:11,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207006362] [2022-12-14 12:11:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 12:11:11,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207006362] [2022-12-14 12:11:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207006362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:11,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016899431] [2022-12-14 12:11:11,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:11,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:11,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:11,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:11,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 12:11:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:12,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:11:12,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 12:11:12,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:11:12,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016899431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:11:12,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:11:12,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 12:11:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947112519] [2022-12-14 12:11:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:11:12,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:11:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:12,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:11:12,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:11:12,019 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:11:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:12,038 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-12-14 12:11:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:11:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-12-14 12:11:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:12,039 INFO L225 Difference]: With dead ends: 27 [2022-12-14 12:11:12,039 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 12:11:12,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:11:12,041 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:12,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 12:11:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-14 12:11:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-12-14 12:11:12,046 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 24 [2022-12-14 12:11:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:12,048 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-12-14 12:11:12,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:11:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-12-14 12:11:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 12:11:12,049 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:12,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:12,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 12:11:12,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:12,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1201952864, now seen corresponding path program 1 times [2022-12-14 12:11:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:12,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678818107] [2022-12-14 12:11:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 12:11:12,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:12,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678818107] [2022-12-14 12:11:12,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678818107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:12,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751881492] [2022-12-14 12:11:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:12,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:12,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:12,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:12,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 12:11:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:12,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:11:12,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 12:11:12,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 12:11:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751881492] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1195968493] [2022-12-14 12:11:12,535 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:12,535 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:12,538 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:12,544 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:12,544 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:12,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,636 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:12,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:12,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:11:12,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:11:12,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:12,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:12,808 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:11:12,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:11:12,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:13,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:13,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:13,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-14 12:11:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:13,218 INFO L321 Elim1Store]: treesize reduction 40, result has 42.0 percent of original size [2022-12-14 12:11:13,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 85 [2022-12-14 12:11:13,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:13,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:13,395 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:13,456 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:18,226 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '524#(and (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= |#NULL.base| 0) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|))' at error location [2022-12-14 12:11:18,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:18,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:18,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2022-12-14 12:11:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294097669] [2022-12-14 12:11:18,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:18,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:11:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:18,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:11:18,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:11:18,229 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:18,252 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-12-14 12:11:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:11:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 25 [2022-12-14 12:11:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:18,253 INFO L225 Difference]: With dead ends: 36 [2022-12-14 12:11:18,253 INFO L226 Difference]: Without dead ends: 21 [2022-12-14 12:11:18,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:11:18,254 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:18,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-14 12:11:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-14 12:11:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-12-14 12:11:18,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2022-12-14 12:11:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:18,257 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-12-14 12:11:18,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-12-14 12:11:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 12:11:18,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:18,258 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:18,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 12:11:18,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:18,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash 405133957, now seen corresponding path program 2 times [2022-12-14 12:11:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:18,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101413785] [2022-12-14 12:11:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 12:11:18,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:18,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101413785] [2022-12-14 12:11:18,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101413785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:18,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413968380] [2022-12-14 12:11:18,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:11:18,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:18,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:18,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:11:18,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 12:11:18,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:11:18,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:11:18,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 12:11:18,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 12:11:18,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413968380] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:18,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651944845] [2022-12-14 12:11:18,606 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:18,606 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:18,606 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:18,607 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:18,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:18,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,633 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:11:18,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-12-14 12:11:18,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,655 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:18,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:18,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 103 [2022-12-14 12:11:18,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,758 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-12-14 12:11:18,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 294 treesize of output 275 [2022-12-14 12:11:18,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:18,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:18,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:18,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:18,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:11:19,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:19,016 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:11:19,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:11:19,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:19,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:19,136 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:19,186 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:23,854 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '797#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (exists ((v_xor_~res~0_BEFORE_RETURN_11 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_11 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_11 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_11 4294967296) (- 4294967296))))) (<= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:11:23,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:23,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:23,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 12:11:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23804405] [2022-12-14 12:11:23,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:23,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:11:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:23,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:11:23,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:11:23,855 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:11:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:23,874 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-12-14 12:11:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:11:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 28 [2022-12-14 12:11:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:23,875 INFO L225 Difference]: With dead ends: 38 [2022-12-14 12:11:23,875 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 12:11:23,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:11:23,875 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:23,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 12:11:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 12:11:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-12-14 12:11:23,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 28 [2022-12-14 12:11:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:23,878 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-12-14 12:11:23,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:11:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-12-14 12:11:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 12:11:23,879 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:23,879 INFO L195 NwaCegarLoop]: trace histogram [12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:23,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:11:24,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:24,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1054750332, now seen corresponding path program 3 times [2022-12-14 12:11:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:24,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167459228] [2022-12-14 12:11:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-12-14 12:11:24,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:24,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167459228] [2022-12-14 12:11:24,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167459228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:24,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273390291] [2022-12-14 12:11:24,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:11:24,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:24,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:24,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 12:11:24,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:11:24,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:11:24,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:11:24,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 12:11:24,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 12:11:24,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273390291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:24,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [941943069] [2022-12-14 12:11:24,349 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:24,349 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:24,349 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:24,349 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:24,349 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:24,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,375 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:24,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:24,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:11:24,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:11:24,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:24,499 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:11:24,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:11:24,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:24,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:24,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:24,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:11:24,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:24,715 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:11:24,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:11:24,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:24,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:24,819 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:24,879 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:29,484 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1141#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:11:29,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:29,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:29,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 14 [2022-12-14 12:11:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438395201] [2022-12-14 12:11:29,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:29,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 12:11:29,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 12:11:29,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=571, Unknown=1, NotChecked=0, Total=702 [2022-12-14 12:11:29,487 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:11:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:29,516 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-12-14 12:11:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 12:11:29,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 37 [2022-12-14 12:11:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:29,517 INFO L225 Difference]: With dead ends: 49 [2022-12-14 12:11:29,517 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 12:11:29,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=130, Invalid=571, Unknown=1, NotChecked=0, Total=702 [2022-12-14 12:11:29,517 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:29,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 12:11:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-12-14 12:11:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-12-14 12:11:29,520 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2022-12-14 12:11:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:29,521 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-12-14 12:11:29,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:11:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-12-14 12:11:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 12:11:29,521 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:29,521 INFO L195 NwaCegarLoop]: trace histogram [12, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:29,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 12:11:29,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:29,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash -876514463, now seen corresponding path program 4 times [2022-12-14 12:11:29,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:29,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170083951] [2022-12-14 12:11:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-14 12:11:29,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:29,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170083951] [2022-12-14 12:11:29,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170083951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:29,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178081551] [2022-12-14 12:11:29,993 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:11:29,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:29,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:29,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:29,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 12:11:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:30,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 12:11:30,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-14 12:11:30,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-14 12:11:30,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178081551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:30,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1792164221] [2022-12-14 12:11:30,232 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:30,232 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:30,233 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:30,233 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:30,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:30,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,256 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:11:30,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-12-14 12:11:30,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,274 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:30,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:30,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 103 [2022-12-14 12:11:30,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,384 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-12-14 12:11:30,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 294 treesize of output 275 [2022-12-14 12:11:30,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:30,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:30,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:30,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:11:30,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:30,584 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:11:30,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:11:30,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:30,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:30,691 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:30,736 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:33,521 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1574#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (exists ((v_xor_~res~0_BEFORE_RETURN_23 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_23 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_23 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_23 4294967296) (- 4294967296))))) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:11:33,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:33,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:33,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 25 [2022-12-14 12:11:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806825343] [2022-12-14 12:11:33,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:33,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 12:11:33,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 12:11:33,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 12:11:33,524 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:33,565 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-12-14 12:11:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 12:11:33,566 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2022-12-14 12:11:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:33,566 INFO L225 Difference]: With dead ends: 62 [2022-12-14 12:11:33,566 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 12:11:33,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 12:11:33,568 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:33,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 12:11:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-14 12:11:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-12-14 12:11:33,572 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 44 [2022-12-14 12:11:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:33,572 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-12-14 12:11:33,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-12-14 12:11:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 12:11:33,573 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:33,573 INFO L195 NwaCegarLoop]: trace histogram [22, 12, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:33,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 12:11:33,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:33,774 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 183340961, now seen corresponding path program 5 times [2022-12-14 12:11:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:33,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611171341] [2022-12-14 12:11:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-14 12:11:34,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:34,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611171341] [2022-12-14 12:11:34,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611171341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:34,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703863110] [2022-12-14 12:11:34,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:11:34,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:34,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:34,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:34,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:11:34,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:11:34,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:11:34,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:11:34,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2022-12-14 12:11:34,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2022-12-14 12:11:34,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703863110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:34,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [583146487] [2022-12-14 12:11:34,485 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:34,485 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:34,485 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:34,485 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:34,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:34,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,507 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:11:34,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-12-14 12:11:34,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,527 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:34,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:34,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 103 [2022-12-14 12:11:34,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,616 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-12-14 12:11:34,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 294 treesize of output 275 [2022-12-14 12:11:34,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:34,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:34,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-14 12:11:34,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:34,839 INFO L321 Elim1Store]: treesize reduction 40, result has 42.0 percent of original size [2022-12-14 12:11:34,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 85 [2022-12-14 12:11:34,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:34,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:34,955 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:34,999 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:37,908 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2139#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (exists ((v_xor_~res~0_BEFORE_RETURN_30 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_30 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_30 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_30 4294967296) (- 4294967296))))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:11:37,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:37,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:37,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 7, 7] total 35 [2022-12-14 12:11:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269035727] [2022-12-14 12:11:37,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:37,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 12:11:37,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:37,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 12:11:37,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1831, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 12:11:37,911 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 35 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:11:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:37,972 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-12-14 12:11:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 12:11:37,972 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-12-14 12:11:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:37,973 INFO L225 Difference]: With dead ends: 69 [2022-12-14 12:11:37,973 INFO L226 Difference]: Without dead ends: 50 [2022-12-14 12:11:37,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=425, Invalid=1831, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 12:11:37,974 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:37,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-14 12:11:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-14 12:11:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-12-14 12:11:37,978 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 56 [2022-12-14 12:11:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:37,978 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-12-14 12:11:37,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:11:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-12-14 12:11:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 12:11:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:37,979 INFO L195 NwaCegarLoop]: trace histogram [30, 23, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:37,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 12:11:38,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 12:11:38,181 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1837507612, now seen corresponding path program 6 times [2022-12-14 12:11:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495949537] [2022-12-14 12:11:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-12-14 12:11:38,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495949537] [2022-12-14 12:11:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495949537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804097249] [2022-12-14 12:11:38,810 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:11:38,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:38,811 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:38,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 12:11:38,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:11:38,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:11:38,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 12:11:38,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-12-14 12:11:38,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-12-14 12:11:39,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804097249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:39,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [454159396] [2022-12-14 12:11:39,461 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:39,461 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:39,462 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:39,462 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:39,462 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:39,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,493 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:39,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:39,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:11:39,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 103 [2022-12-14 12:11:39,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,594 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-12-14 12:11:39,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 294 treesize of output 275 [2022-12-14 12:11:39,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:39,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:39,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-14 12:11:39,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:39,782 INFO L321 Elim1Store]: treesize reduction 45, result has 34.8 percent of original size [2022-12-14 12:11:39,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 80 [2022-12-14 12:11:39,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:39,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:39,878 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:39,918 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:44,749 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2862#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:11:44,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:44,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:44,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 51 [2022-12-14 12:11:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939881580] [2022-12-14 12:11:44,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:44,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-14 12:11:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-14 12:11:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1335, Invalid=2697, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 12:11:44,754 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 51 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:44,809 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2022-12-14 12:11:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 12:11:44,810 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 75 [2022-12-14 12:11:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:44,811 INFO L225 Difference]: With dead ends: 100 [2022-12-14 12:11:44,811 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 12:11:44,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1335, Invalid=2697, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 12:11:44,813 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:44,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:11:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 12:11:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-14 12:11:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-12-14 12:11:44,817 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 75 [2022-12-14 12:11:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:44,817 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-12-14 12:11:44,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-12-14 12:11:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 12:11:44,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:44,818 INFO L195 NwaCegarLoop]: trace histogram [48, 30, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:44,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 12:11:45,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:45,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash -710491935, now seen corresponding path program 7 times [2022-12-14 12:11:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:45,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964274585] [2022-12-14 12:11:45,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-12-14 12:11:46,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:46,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964274585] [2022-12-14 12:11:46,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964274585] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:46,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689795254] [2022-12-14 12:11:46,477 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:11:46,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:46,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:46,477 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:46,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 12:11:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:46,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 12:11:46,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-12-14 12:11:46,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-12-14 12:11:48,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689795254] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:48,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1214767960] [2022-12-14 12:11:48,762 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:48,762 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:48,762 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:48,762 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:48,762 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:48,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,783 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:48,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:11:48,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:11:48,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:48,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:48,873 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:11:48,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:11:48,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:49,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:49,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:49,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:49,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:49,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:11:49,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:49,098 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:11:49,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:11:49,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:49,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:49,195 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:49,238 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:50,225 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3897#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (exists ((v_xor_~res~0_BEFORE_RETURN_42 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_42 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_42 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_42 4294967296) (- 4294967296))))) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:11:50,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:50,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:50,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 51] total 101 [2022-12-14 12:11:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24394042] [2022-12-14 12:11:50,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:50,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-12-14 12:11:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:50,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-12-14 12:11:50,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5110, Invalid=7772, Unknown=0, NotChecked=0, Total=12882 [2022-12-14 12:11:50,235 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 101 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 101 states have internal predecessors, (115), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:50,343 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2022-12-14 12:11:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-12-14 12:11:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 101 states have internal predecessors, (115), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 100 [2022-12-14 12:11:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:50,344 INFO L225 Difference]: With dead ends: 150 [2022-12-14 12:11:50,344 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 12:11:50,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5110, Invalid=7772, Unknown=0, NotChecked=0, Total=12882 [2022-12-14 12:11:50,347 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:50,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:11:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 12:11:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-12-14 12:11:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.025) internal successors, (123), 120 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2022-12-14 12:11:50,353 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 100 [2022-12-14 12:11:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:50,353 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2022-12-14 12:11:50,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 101 states have internal predecessors, (115), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:11:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-12-14 12:11:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-12-14 12:11:50,355 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:50,355 INFO L195 NwaCegarLoop]: trace histogram [98, 30, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:50,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 12:11:50,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:50,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1933959871, now seen corresponding path program 8 times [2022-12-14 12:11:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:50,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660738262] [2022-12-14 12:11:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:11:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5388 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-12-14 12:11:54,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:11:54,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660738262] [2022-12-14 12:11:54,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660738262] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:11:54,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883600579] [2022-12-14 12:11:54,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:11:54,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:54,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:11:54,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:11:54,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 12:11:54,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 12:11:54,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:11:54,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 12:11:54,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:11:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5388 backedges. 246 proven. 3 refuted. 0 times theorem prover too weak. 5139 trivial. 0 not checked. [2022-12-14 12:11:55,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:11:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5388 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5385 trivial. 0 not checked. [2022-12-14 12:11:55,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883600579] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:11:55,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1597707070] [2022-12-14 12:11:55,178 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:11:55,178 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:11:55,178 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:11:55,179 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:11:55,179 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:11:55,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,203 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:11:55,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:11:55,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:11:55,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 103 [2022-12-14 12:11:55,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,320 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-12-14 12:11:55,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 294 treesize of output 275 [2022-12-14 12:11:55,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:11:55,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:11:55,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:11:55,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:11:55,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:11:55,484 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:11:55,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:11:55,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:11:55,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:11:55,580 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:11:55,631 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:11:59,052 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5438#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (exists ((v_xor_~res~0_BEFORE_RETURN_48 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_48 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_48 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_48 4294967296) (- 4294967296))))) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:11:59,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:11:59,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:11:59,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 5, 5] total 107 [2022-12-14 12:11:59,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386158791] [2022-12-14 12:11:59,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:11:59,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-12-14 12:11:59,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:11:59,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-12-14 12:11:59,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5137, Invalid=9143, Unknown=0, NotChecked=0, Total=14280 [2022-12-14 12:11:59,057 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand has 107 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:11:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:11:59,159 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2022-12-14 12:11:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-12-14 12:11:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 150 [2022-12-14 12:11:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:11:59,161 INFO L225 Difference]: With dead ends: 155 [2022-12-14 12:11:59,161 INFO L226 Difference]: Without dead ends: 130 [2022-12-14 12:11:59,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5137, Invalid=9143, Unknown=0, NotChecked=0, Total=14280 [2022-12-14 12:11:59,164 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:11:59,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:11:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-14 12:11:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-12-14 12:11:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.024) internal successors, (128), 125 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:11:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2022-12-14 12:11:59,174 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 150 [2022-12-14 12:11:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:11:59,175 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2022-12-14 12:11:59,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:11:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-12-14 12:11:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-12-14 12:11:59,177 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:11:59,177 INFO L195 NwaCegarLoop]: trace histogram [99, 30, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:11:59,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 12:11:59,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:11:59,379 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:11:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:11:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash -746336484, now seen corresponding path program 9 times [2022-12-14 12:11:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:11:59,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120433214] [2022-12-14 12:11:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:11:59,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:11:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5505 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-12-14 12:12:04,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:12:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120433214] [2022-12-14 12:12:04,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120433214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:12:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114693549] [2022-12-14 12:12:04,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:12:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:12:04,110 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:12:04,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 12:12:04,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:12:04,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:12:04,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 101 conjunts are in the unsatisfiable core [2022-12-14 12:12:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:12:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5505 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-12-14 12:12:04,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:12:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5505 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-12-14 12:12:07,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114693549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:12:07,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1042178603] [2022-12-14 12:12:07,334 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:12:07,334 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:12:07,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:12:07,334 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:12:07,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:12:07,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,356 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:12:07,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:12:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:12:07,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 103 [2022-12-14 12:12:07,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,448 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-12-14 12:12:07,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 294 treesize of output 275 [2022-12-14 12:12:07,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:12:07,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:12:07,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:07,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:12:07,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:07,632 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:12:07,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:12:07,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:12:07,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:12:07,726 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:12:07,771 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:12:15,121 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7025#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (exists ((v_xor_~res~0_BEFORE_RETURN_53 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_53 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_53 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_53 4294967296) (- 4294967296))))) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:12:15,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:12:15,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:12:15,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 101, 102] total 103 [2022-12-14 12:12:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822063210] [2022-12-14 12:12:15,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:12:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-12-14 12:12:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:12:15,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-12-14 12:12:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5313, Invalid=8027, Unknown=0, NotChecked=0, Total=13340 [2022-12-14 12:12:15,124 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 103 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 103 states have internal predecessors, (116), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:12:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:12:15,214 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2022-12-14 12:12:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-14 12:12:15,215 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 103 states have internal predecessors, (116), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 155 [2022-12-14 12:12:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:12:15,215 INFO L225 Difference]: With dead ends: 160 [2022-12-14 12:12:15,216 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 12:12:15,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 351 SyntacticMatches, 100 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6788 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=5313, Invalid=8027, Unknown=0, NotChecked=0, Total=13340 [2022-12-14 12:12:15,217 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:12:15,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:12:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 12:12:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-12-14 12:12:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0238095238095237) internal successors, (129), 126 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:12:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-12-14 12:12:15,222 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 155 [2022-12-14 12:12:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:12:15,223 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-12-14 12:12:15,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 103 states have internal predecessors, (116), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:12:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-12-14 12:12:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 12:12:15,224 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:12:15,224 INFO L195 NwaCegarLoop]: trace histogram [100, 30, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:12:15,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 12:12:15,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 12:12:15,426 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:12:15,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:12:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 635617633, now seen corresponding path program 10 times [2022-12-14 12:12:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:12:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810670572] [2022-12-14 12:12:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:12:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:12:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5605 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2022-12-14 12:12:15,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:12:15,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810670572] [2022-12-14 12:12:15,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810670572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:12:15,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563014517] [2022-12-14 12:12:15,907 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:12:15,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:12:15,908 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:12:15,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 12:12:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:16,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 12:12:16,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:12:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5605 backedges. 244 proven. 55 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2022-12-14 12:12:16,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:12:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5605 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 5306 trivial. 0 not checked. [2022-12-14 12:12:16,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563014517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:12:16,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1149723276] [2022-12-14 12:12:16,229 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:12:16,229 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:12:16,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:12:16,230 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:12:16,230 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:12:16,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,245 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:12:16,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-12-14 12:12:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,260 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:12:16,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:12:16,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:12:16,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:16,338 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:12:16,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:12:16,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:12:16,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:12:16,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:16,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:12:16,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:16,522 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:12:16,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:12:16,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:12:16,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:12:16,597 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:12:16,636 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:12:23,350 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8552#(and (exists ((v_xor_~res~0_BEFORE_RETURN_60 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_60 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_60 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_60 4294967296) (- 4294967296))))) (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:12:23,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:12:23,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:12:23,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-12-14 12:12:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422288262] [2022-12-14 12:12:23,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:12:23,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 12:12:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:12:23,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 12:12:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 12:12:23,352 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 12:12:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:12:23,380 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2022-12-14 12:12:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 12:12:23,380 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-12-14 12:12:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:12:23,381 INFO L225 Difference]: With dead ends: 171 [2022-12-14 12:12:23,381 INFO L226 Difference]: Without dead ends: 143 [2022-12-14 12:12:23,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 12:12:23,382 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:12:23,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:12:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-14 12:12:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-12-14 12:12:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0217391304347827) internal successors, (141), 138 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:12:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2022-12-14 12:12:23,392 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 156 [2022-12-14 12:12:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:12:23,392 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2022-12-14 12:12:23,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 12:12:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2022-12-14 12:12:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 12:12:23,395 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:12:23,395 INFO L195 NwaCegarLoop]: trace histogram [100, 66, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:12:23,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 12:12:23,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 12:12:23,597 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:12:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:12:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1097692193, now seen corresponding path program 11 times [2022-12-14 12:12:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:12:23,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562325991] [2022-12-14 12:12:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:12:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:12:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7423 backedges. 0 proven. 1313 refuted. 0 times theorem prover too weak. 6110 trivial. 0 not checked. [2022-12-14 12:12:24,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:12:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562325991] [2022-12-14 12:12:24,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562325991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:12:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690524719] [2022-12-14 12:12:24,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:12:24,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:12:24,474 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:12:24,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 12:12:24,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 12:12:24,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:12:24,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 12:12:24,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:12:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7423 backedges. 1062 proven. 21 refuted. 0 times theorem prover too weak. 6340 trivial. 0 not checked. [2022-12-14 12:12:24,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:12:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7423 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7402 trivial. 0 not checked. [2022-12-14 12:12:24,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690524719] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:12:24,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [735838513] [2022-12-14 12:12:24,935 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:12:24,935 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:12:24,936 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:12:24,936 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:12:24,936 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:12:24,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:24,955 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:12:24,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-12-14 12:12:24,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:24,972 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:12:24,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:12:24,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:24,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:12:25,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:25,053 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:12:25,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:12:25,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:12:25,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:12:25,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:25,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:12:25,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:25,229 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:12:25,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:12:25,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:12:25,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:12:25,318 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:12:25,360 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:12:26,167 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10355#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (exists ((v_xor_~res~0_BEFORE_RETURN_66 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_66 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_66 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_66 4294967296) (- 4294967296))))) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:12:26,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:12:26,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:12:26,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9, 9] total 39 [2022-12-14 12:12:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553884343] [2022-12-14 12:12:26,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:12:26,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 12:12:26,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:12:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 12:12:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2173, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 12:12:26,169 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand has 39 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 39 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:12:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:12:26,220 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2022-12-14 12:12:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 12:12:26,221 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 39 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 192 [2022-12-14 12:12:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:12:26,222 INFO L225 Difference]: With dead ends: 192 [2022-12-14 12:12:26,222 INFO L226 Difference]: Without dead ends: 152 [2022-12-14 12:12:26,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=2173, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 12:12:26,223 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:12:26,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:12:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-14 12:12:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-12-14 12:12:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.0204081632653061) internal successors, (150), 147 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:12:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2022-12-14 12:12:26,229 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 192 [2022-12-14 12:12:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:12:26,229 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2022-12-14 12:12:26,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 39 states have internal predecessors, (57), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:12:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2022-12-14 12:12:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-14 12:12:26,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:12:26,231 INFO L195 NwaCegarLoop]: trace histogram [100, 69, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:12:26,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 12:12:26,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:26,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:12:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:12:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1936271572, now seen corresponding path program 12 times [2022-12-14 12:12:26,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:12:26,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130484698] [2022-12-14 12:12:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:12:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:12:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 6287 trivial. 0 not checked. [2022-12-14 12:12:27,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:12:27,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130484698] [2022-12-14 12:12:27,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130484698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:12:27,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467174657] [2022-12-14 12:12:27,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:12:27,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:12:27,328 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:12:27,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 12:12:27,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:12:27,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:12:27,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 12:12:27,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:12:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 1154 proven. 276 refuted. 0 times theorem prover too weak. 6287 trivial. 0 not checked. [2022-12-14 12:12:27,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:12:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 6287 trivial. 0 not checked. [2022-12-14 12:12:28,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467174657] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:12:28,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1352113642] [2022-12-14 12:12:28,158 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:12:28,158 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:12:28,158 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:12:28,158 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:12:28,158 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:12:28,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,179 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:12:28,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-12-14 12:12:28,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,198 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:12:28,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:12:28,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:12:28,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:28,290 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:12:28,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:12:28,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:12:28,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:12:28,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-14 12:12:28,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:28,514 INFO L321 Elim1Store]: treesize reduction 40, result has 42.0 percent of original size [2022-12-14 12:12:28,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 85 [2022-12-14 12:12:28,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:12:28,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:12:28,647 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:12:28,683 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:12:33,448 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12296#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (exists ((v_xor_~res~0_BEFORE_RETURN_72 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_72 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_72 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_72 4294967296) (- 4294967296))))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:12:33,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:12:33,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:12:33,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2022-12-14 12:12:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492273434] [2022-12-14 12:12:33,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:12:33,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-14 12:12:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:12:33,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-14 12:12:33,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1335, Invalid=2697, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 12:12:33,450 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand has 51 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 12:12:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:12:33,519 INFO L93 Difference]: Finished difference Result 226 states and 260 transitions. [2022-12-14 12:12:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 12:12:33,519 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 203 [2022-12-14 12:12:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:12:33,520 INFO L225 Difference]: With dead ends: 226 [2022-12-14 12:12:33,520 INFO L226 Difference]: Without dead ends: 177 [2022-12-14 12:12:33,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1335, Invalid=2697, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 12:12:33,521 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:12:33,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:12:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-12-14 12:12:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-12-14 12:12:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0174418604651163) internal successors, (175), 172 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:12:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2022-12-14 12:12:33,527 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 203 [2022-12-14 12:12:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:12:33,527 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2022-12-14 12:12:33,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 12:12:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2022-12-14 12:12:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2022-12-14 12:12:33,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:12:33,528 INFO L195 NwaCegarLoop]: trace histogram [144, 100, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:12:33,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 12:12:33,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 12:12:33,729 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:12:33,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:12:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash 732756545, now seen corresponding path program 13 times [2022-12-14 12:12:33,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:12:33,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576560908] [2022-12-14 12:12:33,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:12:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:12:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15892 backedges. 0 proven. 5980 refuted. 0 times theorem prover too weak. 9912 trivial. 0 not checked. [2022-12-14 12:12:36,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:12:36,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576560908] [2022-12-14 12:12:36,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576560908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:12:36,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759951986] [2022-12-14 12:12:36,503 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:12:36,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:36,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:12:36,504 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:12:36,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 12:12:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:36,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 12:12:36,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:12:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15892 backedges. 4804 proven. 1176 refuted. 0 times theorem prover too weak. 9912 trivial. 0 not checked. [2022-12-14 12:12:36,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:12:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15892 backedges. 0 proven. 5980 refuted. 0 times theorem prover too weak. 9912 trivial. 0 not checked. [2022-12-14 12:12:38,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759951986] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:12:38,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [777384762] [2022-12-14 12:12:38,840 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:12:38,840 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:12:38,841 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:12:38,841 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:12:38,841 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:12:38,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,858 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:12:38,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:12:38,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:12:38,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:12:38,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:38,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:38,949 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:12:38,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:12:39,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:12:39,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:39,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:12:39,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:39,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:39,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:12:39,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:39,147 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:12:39,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:12:39,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:12:39,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:12:39,247 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:12:39,286 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:12:40,257 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14855#(and (exists ((v_xor_~res~0_BEFORE_RETURN_77 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_77 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_77 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_77 4294967296) (- 4294967296))))) (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:12:40,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:12:40,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:12:40,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2022-12-14 12:12:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024157879] [2022-12-14 12:12:40,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:12:40,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-12-14 12:12:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:12:40,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-12-14 12:12:40,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5110, Invalid=7772, Unknown=0, NotChecked=0, Total=12882 [2022-12-14 12:12:40,262 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand has 101 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 101 states have internal predecessors, (118), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 12:12:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:12:40,368 INFO L93 Difference]: Finished difference Result 301 states and 360 transitions. [2022-12-14 12:12:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-12-14 12:12:40,368 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 101 states have internal predecessors, (118), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 278 [2022-12-14 12:12:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:12:40,370 INFO L225 Difference]: With dead ends: 301 [2022-12-14 12:12:40,371 INFO L226 Difference]: Without dead ends: 227 [2022-12-14 12:12:40,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5110, Invalid=7772, Unknown=0, NotChecked=0, Total=12882 [2022-12-14 12:12:40,372 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:12:40,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:12:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-12-14 12:12:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-12-14 12:12:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 222 states have (on average 1.0135135135135136) internal successors, (225), 222 states have internal predecessors, (225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:12:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2022-12-14 12:12:40,379 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 278 [2022-12-14 12:12:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:12:40,379 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2022-12-14 12:12:40,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 101 states have internal predecessors, (118), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 12:12:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2022-12-14 12:12:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2022-12-14 12:12:40,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:12:40,381 INFO L195 NwaCegarLoop]: trace histogram [294, 100, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:12:40,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 12:12:40,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 12:12:40,583 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:12:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:12:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1076964449, now seen corresponding path program 14 times [2022-12-14 12:12:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:12:40,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913136163] [2022-12-14 12:12:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:12:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:12:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:12:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 49117 backedges. 0 proven. 24455 refuted. 0 times theorem prover too weak. 24662 trivial. 0 not checked. [2022-12-14 12:12:50,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:12:50,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913136163] [2022-12-14 12:12:50,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913136163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:12:50,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123197842] [2022-12-14 12:12:50,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:12:50,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:12:50,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:12:50,223 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:12:50,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 12:12:52,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-12-14 12:12:52,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:12:52,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 12:12:52,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:12:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 49117 backedges. 19606 proven. 105 refuted. 0 times theorem prover too weak. 29406 trivial. 0 not checked. [2022-12-14 12:12:52,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:12:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 49117 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 49012 trivial. 0 not checked. [2022-12-14 12:12:53,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123197842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:12:53,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325897373] [2022-12-14 12:12:53,191 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:12:53,191 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:12:53,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:12:53,191 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:12:53,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:12:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,209 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:12:53,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-12-14 12:12:53,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,226 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:12:53,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:12:53,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:12:53,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:53,319 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:12:53,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:12:53,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:12:53,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:12:53,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:12:53,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:12:53,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:12:53,547 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:12:53,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:12:53,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:12:53,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:12:53,631 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:12:53,671 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:13:01,518 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18594#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (exists ((v_xor_~res~0_BEFORE_RETURN_84 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_84 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_84 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_84 4294967296) (- 4294967296))))) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:13:01,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:13:01,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:13:01,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 17, 17] total 131 [2022-12-14 12:13:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047149341] [2022-12-14 12:13:01,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:13:01,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-12-14 12:13:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:13:01,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-12-14 12:13:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5605, Invalid=14987, Unknown=0, NotChecked=0, Total=20592 [2022-12-14 12:13:01,521 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand has 131 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:13:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:13:01,647 INFO L93 Difference]: Finished difference Result 368 states and 394 transitions. [2022-12-14 12:13:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-12-14 12:13:01,647 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 428 [2022-12-14 12:13:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:13:01,648 INFO L225 Difference]: With dead ends: 368 [2022-12-14 12:13:01,648 INFO L226 Difference]: Without dead ends: 244 [2022-12-14 12:13:01,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1241 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4808 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=5605, Invalid=14987, Unknown=0, NotChecked=0, Total=20592 [2022-12-14 12:13:01,650 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:13:01,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:13:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-12-14 12:13:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-12-14 12:13:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.0125523012552302) internal successors, (242), 239 states have internal predecessors, (242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:13:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 248 transitions. [2022-12-14 12:13:01,657 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 248 transitions. Word has length 428 [2022-12-14 12:13:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:13:01,657 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 248 transitions. [2022-12-14 12:13:01,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:13:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2022-12-14 12:13:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-12-14 12:13:01,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:13:01,660 INFO L195 NwaCegarLoop]: trace histogram [297, 100, 30, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:13:01,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 12:13:01,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:13:01,860 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:13:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:13:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash 67627884, now seen corresponding path program 15 times [2022-12-14 12:13:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:13:01,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326034050] [2022-12-14 12:13:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:13:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:13:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:13:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 50371 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 49906 trivial. 0 not checked. [2022-12-14 12:13:04,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:13:04,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326034050] [2022-12-14 12:13:04,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326034050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:13:04,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507913135] [2022-12-14 12:13:04,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:13:04,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:13:04,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:13:04,588 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:13:04,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 12:13:05,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:13:05,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:13:05,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 2436 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 12:13:05,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:13:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 50371 backedges. 20004 proven. 465 refuted. 0 times theorem prover too weak. 29902 trivial. 0 not checked. [2022-12-14 12:13:05,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:13:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 50371 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 49906 trivial. 0 not checked. [2022-12-14 12:13:06,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507913135] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:13:06,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [3792725] [2022-12-14 12:13:06,049 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:13:06,050 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:13:06,050 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:13:06,050 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:13:06,050 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:13:06,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,073 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:13:06,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:13:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:13:06,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-12-14 12:13:06,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:13:06,179 INFO L321 Elim1Store]: treesize reduction 126, result has 21.7 percent of original size [2022-12-14 12:13:06,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 26 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 284 treesize of output 276 [2022-12-14 12:13:06,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:13:06,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:13:06,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-14 12:13:06,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:06,397 INFO L321 Elim1Store]: treesize reduction 40, result has 42.0 percent of original size [2022-12-14 12:13:06,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 85 [2022-12-14 12:13:06,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:13:06,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:13:06,508 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:13:06,552 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:13:09,565 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '22549#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (exists ((v_xor_~res~0_BEFORE_RETURN_90 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_90 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_90 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_90 4294967296) (- 4294967296))))) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:13:09,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:13:09,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:13:09,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2022-12-14 12:13:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641398697] [2022-12-14 12:13:09,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:13:09,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 12:13:09,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:13:09,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 12:13:09,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2140, Invalid=3866, Unknown=0, NotChecked=0, Total=6006 [2022-12-14 12:13:09,567 INFO L87 Difference]: Start difference. First operand 244 states and 248 transitions. Second operand has 65 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 12:13:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:13:09,630 INFO L93 Difference]: Finished difference Result 383 states and 419 transitions. [2022-12-14 12:13:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-14 12:13:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 447 [2022-12-14 12:13:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:13:09,632 INFO L225 Difference]: With dead ends: 383 [2022-12-14 12:13:09,633 INFO L226 Difference]: Without dead ends: 276 [2022-12-14 12:13:09,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1372 GetRequests, 1296 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2140, Invalid=3866, Unknown=0, NotChecked=0, Total=6006 [2022-12-14 12:13:09,634 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:13:09,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:13:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-12-14 12:13:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-12-14 12:13:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.011070110701107) internal successors, (274), 271 states have internal predecessors, (274), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:13:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2022-12-14 12:13:09,643 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 447 [2022-12-14 12:13:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:13:09,643 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2022-12-14 12:13:09,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 12:13:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2022-12-14 12:13:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2022-12-14 12:13:09,645 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:13:09,645 INFO L195 NwaCegarLoop]: trace histogram [297, 100, 62, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:13:09,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 12:13:09,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 12:13:09,847 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:13:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:13:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 632544620, now seen corresponding path program 16 times [2022-12-14 12:13:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:13:09,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829471016] [2022-12-14 12:13:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:13:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:13:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:13:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 51859 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 49906 trivial. 0 not checked. [2022-12-14 12:13:15,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:13:15,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829471016] [2022-12-14 12:13:15,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829471016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:13:15,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291477225] [2022-12-14 12:13:15,636 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:13:15,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:13:15,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:13:15,637 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:13:15,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 12:13:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:13:16,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-14 12:13:16,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:13:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 51859 backedges. 20004 proven. 1953 refuted. 0 times theorem prover too weak. 29902 trivial. 0 not checked. [2022-12-14 12:13:16,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:13:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 51859 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 49906 trivial. 0 not checked. [2022-12-14 12:13:18,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291477225] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:13:18,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1595266836] [2022-12-14 12:13:18,809 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 12:13:18,810 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:13:18,810 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:13:18,810 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:13:18,810 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:13:18,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,832 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:13:18,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 12:13:18,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 12:13:18,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 103 [2022-12-14 12:13:18,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:18,933 INFO L321 Elim1Store]: treesize reduction 144, result has 13.3 percent of original size [2022-12-14 12:13:18,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 32 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 12 case distinctions, treesize of input 294 treesize of output 275 [2022-12-14 12:13:18,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 12:13:19,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:19,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 12:13:19,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:19,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:13:19,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:13:19,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:13:19,110 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-12-14 12:13:19,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-12-14 12:13:19,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-14 12:13:19,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:13:19,202 INFO L197 IcfgInterpreter]: Interpreting procedure xor with input of size 12 for LOIs [2022-12-14 12:13:19,241 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:13:20,577 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '26829#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (exists ((v_xor_~res~0_BEFORE_RETURN_96 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_xor_~res~0_BEFORE_RETURN_96 4294967296) 2147483647) (mod v_xor_~res~0_BEFORE_RETURN_96 4294967296) (+ (mod v_xor_~res~0_BEFORE_RETURN_96 4294967296) (- 4294967296))))) (= |ULTIMATE.start_main_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 396 |ULTIMATE.start_main_~#x~0#1.offset|))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (or (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~0#1|)) (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~0#1|))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 99 |ULTIMATE.start_main_~i~2#1|) (<= 0 (+ |ULTIMATE.start_main_~ret~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 100 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.base| 0))' at error location [2022-12-14 12:13:20,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:13:20,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:13:20,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 102 [2022-12-14 12:13:20,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120887279] [2022-12-14 12:13:20,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:13:20,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-12-14 12:13:20,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:13:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-12-14 12:13:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5211, Invalid=7899, Unknown=0, NotChecked=0, Total=13110 [2022-12-14 12:13:20,582 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand has 102 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 102 states have internal predecessors, (117), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 12:13:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:13:20,713 INFO L93 Difference]: Finished difference Result 420 states and 461 transitions. [2022-12-14 12:13:20,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-12-14 12:13:20,713 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 102 states have internal predecessors, (117), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 479 [2022-12-14 12:13:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:13:20,714 INFO L225 Difference]: With dead ends: 420 [2022-12-14 12:13:20,714 INFO L226 Difference]: Without dead ends: 313 [2022-12-14 12:13:20,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1500 GetRequests, 1360 SyntacticMatches, 27 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3361 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5211, Invalid=7899, Unknown=0, NotChecked=0, Total=13110 [2022-12-14 12:13:20,715 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:13:20,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:13:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-12-14 12:13:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-12-14 12:13:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.0097402597402598) internal successors, (311), 308 states have internal predecessors, (311), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:13:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 317 transitions. [2022-12-14 12:13:20,724 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 317 transitions. Word has length 479 [2022-12-14 12:13:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:13:20,725 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 317 transitions. [2022-12-14 12:13:20,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 102 states have internal predecessors, (117), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 12:13:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 317 transitions. [2022-12-14 12:13:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2022-12-14 12:13:20,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:13:20,727 INFO L195 NwaCegarLoop]: trace histogram [297, 100, 99, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:13:20,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 12:13:20,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:13:20,929 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:13:20,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:13:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1600417797, now seen corresponding path program 17 times [2022-12-14 12:13:20,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:13:20,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512943648] [2022-12-14 12:13:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:13:20,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:17:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 12:17:44,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 12:22:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 12:22:14,460 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 12:22:14,460 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 12:22:14,461 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 12:22:14,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 12:22:14,464 INFO L445 BasicCegarLoop]: Path program histogram: [17, 1, 1, 1] [2022-12-14 12:22:14,467 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 12:22:14,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 12:22:14 BoogieIcfgContainer [2022-12-14 12:22:14,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 12:22:14,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 12:22:14,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 12:22:14,648 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 12:22:14,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:11:10" (3/4) ... [2022-12-14 12:22:14,650 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 12:22:14,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 12:22:14,650 INFO L158 Benchmark]: Toolchain (without parser) took 664206.37ms. Allocated memory was 132.1MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 100.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-12-14 12:22:14,650 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:22:14,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.71ms. Allocated memory is still 132.1MB. Free memory was 100.0MB in the beginning and 89.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 12:22:14,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.91ms. Allocated memory is still 132.1MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 12:22:14,651 INFO L158 Benchmark]: Boogie Preprocessor took 18.18ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 86.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 12:22:14,651 INFO L158 Benchmark]: RCFGBuilder took 288.73ms. Allocated memory is still 132.1MB. Free memory was 86.1MB in the beginning and 69.7MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 12:22:14,651 INFO L158 Benchmark]: TraceAbstraction took 663705.46ms. Allocated memory was 132.1MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 69.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-12-14 12:22:14,651 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 3.0GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:22:14,652 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.71ms. Allocated memory is still 132.1MB. Free memory was 100.0MB in the beginning and 89.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.91ms. Allocated memory is still 132.1MB. Free memory was 89.2MB in the beginning and 87.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.18ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 86.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 288.73ms. Allocated memory is still 132.1MB. Free memory was 86.1MB in the beginning and 69.7MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 663705.46ms. Allocated memory was 132.1MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 69.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 3.0GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 53]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXor at line 24. Possible FailurePath: [L31] int x[100]; [L32] int temp; [L33] int ret; [L34] int ret2; [L35] int ret5; [L37] int i = 0; VAL [i=0, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=1, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=2, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=3, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=4, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=5, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=6, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=7, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=8, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=9, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=10, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=11, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=12, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=13, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=14, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=15, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=16, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=17, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=18, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=19, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=20, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=21, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=22, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=23, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=24, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=25, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=26, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=27, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=28, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=29, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=30, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=31, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=32, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=33, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=34, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=35, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=36, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=37, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=38, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=39, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=40, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=41, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=42, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=43, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=44, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=45, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=46, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=47, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=48, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=49, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=50, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=51, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=52, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=53, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=54, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=55, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=56, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=57, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=58, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=59, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=60, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=61, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=62, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=63, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=64, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=65, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=66, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=67, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=68, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=69, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=70, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=71, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=72, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=73, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=74, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=75, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=76, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=77, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=78, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=79, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=80, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=81, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=82, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=83, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=84, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=85, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=86, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=87, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=88, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=89, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=90, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=91, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=92, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=93, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=94, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=95, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=96, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=97, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=98, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=99, x={9:0}] [L37] COND TRUE i < 100 [L38] x[i] = __VERIFIER_nondet_int() [L37] i++ VAL [i=100, x={9:0}] [L37] COND FALSE !(i < 100) VAL [i=100, x={9:0}] [L41] CALL, EXPR xor(x) VAL [x={9:0}] [L20] int i; [L21] long long res; [L22] EXPR x[0] [L22] res = x[0] [L23] i = 1 VAL [i=1, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=2, res=-7, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=3, res=-6, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=4, res=-6, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=5, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=6, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=7, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=8, res=6, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=9, res=4, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=10, res=1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=11, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=12, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=13, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=14, res=11, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=15, res=11, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=16, res=11, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=17, res=-45, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=18, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=19, res=-12, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=20, res=13, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=21, res=-64, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=22, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=23, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=24, res=-36, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=25, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=26, res=45, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=27, res=45, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=28, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=29, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=30, res=-33, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=31, res=-20, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=32, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=33, res=43, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=34, res=15, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=35, res=15, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=36, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=37, res=-15, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=38, res=-15, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=39, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=40, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=41, res=66, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=42, res=-18, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=43, res=65, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=44, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=45, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=46, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=47, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=48, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=49, res=37, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=50, res=-55, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=51, res=-55, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=52, res=-55, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=53, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=54, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=55, res=50, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=56, res=50, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=57, res=-8, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=58, res=14, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=59, res=-28, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=60, res=-28, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=61, res=-28, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=62, res=-28, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=63, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=64, res=-2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=65, res=17, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=66, res=17, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=67, res=17, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=68, res=17, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=69, res=19, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=70, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=71, res=73, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=72, res=73, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=73, res=73, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=74, res=77, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=75, res=77, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=76, res=77, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=77, res=77, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=78, res=77, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=79, res=77, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=80, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=81, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=82, res=191, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=83, res=191, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=84, res=-10, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=85, res=-159, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=86, res=89, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=87, res=89, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=88, res=89, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=89, res=89, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=90, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=91, res=-215, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=92, res=-2147483651, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=93, res=-2147483651, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=94, res=-2147483651, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=95, res=-2147483651, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=96, res=-3, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=97, res=-21, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=98, res=-21, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=99, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=100, res=-1, x={9:0}, x={9:0}] [L23] COND FALSE !(i < 100) [L26] return res; [L41] RET, EXPR xor(x) VAL [i=100, x={9:0}, xor(x)=-1] [L41] ret = xor(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [i=100, ret=-1, temp=0, x={9:0}] [L44] CALL, EXPR xor(x) VAL [x={9:0}] [L20] int i; [L21] long long res; [L22] EXPR x[0] [L22] res = x[0] [L23] i = 1 VAL [i=1, res=-7, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=2, res=-7, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=3, res=-26, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=4, res=-26, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=5, res=31, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=6, res=22, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=7, res=-23, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=8, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=9, res=5, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=10, res=4, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=11, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=12, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=13, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=14, res=11, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=15, res=47, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=16, res=-57, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=17, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=18, res=41, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=19, res=10, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=20, res=35, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=21, res=-81, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=22, res=63, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=23, res=63, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=24, res=27, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=25, res=-22, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=26, res=23, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=27, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=28, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=29, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=30, res=-33, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=31, res=-33, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=32, res=62, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=33, res=62, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=34, res=-16, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=35, res=-16, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=36, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=37, res=-15, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=38, res=-15, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=39, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=40, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=41, res=66, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=42, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=43, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=44, res=65, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=45, res=65, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=46, res=65, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=47, res=65, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=48, res=65, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=49, res=71, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=50, res=33, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=51, res=33, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=52, res=33, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=53, res=29, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=54, res=29, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=55, res=18, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=56, res=18, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=57, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=58, res=34, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=59, res=-19, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=60, res=-19, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=61, res=-19, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=62, res=-19, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=63, res=-2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=64, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=65, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=66, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=67, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=68, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=69, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=70, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=71, res=39, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=72, res=-78, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=73, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=74, res=77, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=75, res=-14, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=76, res=38, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=77, res=38, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=78, res=38, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=79, res=38, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=80, res=-58, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=81, res=-59, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=82, res=-59, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=83, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=84, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=85, res=61, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=86, res=55, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=87, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=88, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=89, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=90, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=91, res=-215, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=92, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=93, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=94, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=95, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=96, res=2147483649, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=97, res=4294967296, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=98, res=4294967296, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=99, res=4294967296, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=100, res=4294967296, x={9:0}, x={9:0}] [L23] COND FALSE !(i < 100) [L26] return res; [L44] RET, EXPR xor(x) VAL [i=100, ret=-1, temp=0, x={9:0}, xor(x)=0] [L44] ret2 = xor(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [i=100, i=0, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=1, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=2, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=3, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=4, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=5, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=6, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=7, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=8, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=9, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=10, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=11, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=12, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=13, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=14, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=15, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=16, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=17, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=18, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=19, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=20, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=21, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=22, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=23, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=24, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=25, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=26, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=27, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=28, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=29, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=30, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=31, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=32, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=33, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=34, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=35, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=36, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=37, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=38, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=39, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=40, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=41, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=42, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=43, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=44, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=45, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=46, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=47, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=48, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=49, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=50, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=51, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=52, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=53, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=54, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=55, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=56, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=57, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=58, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=59, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=60, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=61, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=62, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=63, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=64, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=65, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=66, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=67, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=68, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=69, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=70, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=71, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=72, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=73, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=74, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=75, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=76, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=77, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=78, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=79, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=80, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=81, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=82, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=83, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=84, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=85, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=86, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=87, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=88, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=89, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=90, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=91, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=92, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=93, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=94, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=95, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=96, i=100, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=97, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=98, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND TRUE i<100 -1 [L47] EXPR x[i+1] [L47] x[i] = x[i+1] [L46] i++ VAL [i=100, i=99, ret=-1, ret2=0, temp=-7, x={9:0}] [L46] COND FALSE !(i<100 -1) [L49] x[100 -1] = temp VAL [i=100, i=99, ret=-1, ret2=0, temp=-7, x={9:0}] [L50] CALL, EXPR xor(x) VAL [x={9:0}] [L20] int i; [L21] long long res; [L22] EXPR x[0] [L22] res = x[0] [L23] i = 1 VAL [i=1, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=2, res=7, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=3, res=7, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=4, res=-9, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=5, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=6, res=-11, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=7, res=-103, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=8, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=9, res=3, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=10, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=11, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=12, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=13, res=11, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=14, res=165, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=15, res=57, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=16, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=17, res=41, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=18, res=25, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=19, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=20, res=-63, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=21, res=-5, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=22, res=-5, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=23, res=45, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=24, res=-46, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=25, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=26, res=23, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=27, res=-4, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=28, res=95, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=29, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=30, res=95, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=31, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=32, res=43, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=33, res=43, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=34, res=43, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=35, res=-16, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=36, res=42, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=37, res=42, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=38, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=39, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=40, res=66, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=41, res=66, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=42, res=65, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=43, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=44, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=45, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=46, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=47, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=48, res=37, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=49, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=50, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=51, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=52, res=50, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=53, res=50, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=54, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=55, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=56, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=57, res=51, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=58, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=59, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=60, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=61, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=62, res=53, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=63, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=64, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=65, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=66, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=67, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=68, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=69, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=70, res=73, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=71, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=72, res=78, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=73, res=155, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=74, res=154, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=75, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=76, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=77, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=78, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=79, res=-79, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=80, res=-113, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=81, res=191, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=82, res=58, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=83, res=-193, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=84, res=-193, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=85, res=54, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=86, res=55, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=87, res=55, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=88, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=89, res=197, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=90, res=-17, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=91, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=92, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=93, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=94, res=2, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=95, res=2147483647, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=96, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=97, res=0, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=98, res=21, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=99, res=-1, x={9:0}, x={9:0}] [L23] COND TRUE i < 100 [L24] EXPR x[i] [L24] res = res ^ x[i] [L23] i++ VAL [i=100, res=2147483646, x={9:0}, x={9:0}] [L23] COND FALSE !(i < 100) [L26] return res; [L50] RET, EXPR xor(x) VAL [i=99, i=100, ret=-1, ret2=0, temp=-7, x={9:0}, xor(x)=2147483646] [L50] ret5 = xor(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [i=100, i=99, ret=-1, ret2=0, ret5=2147483646, temp=-7, x={9:0}] [L53] reach_error() VAL [i=99, i=100, ret=-1, ret2=0, ret5=2147483646, temp=-7, x={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 663.5s, OverallIterations: 20, TraceHistogramMax: 297, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1164 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 935 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1525 IncrementalHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 229 mSDtfsCounter, 1525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9225 GetRequests, 7951 SyntacticMatches, 127 SemanticMatches, 1147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27768 ImplicationChecksByTransitivity, 84.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=19, InterpolantAutomatonStates: 962, 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, 19 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 267.8s SatisfiabilityAnalysisTime, 47.3s InterpolantComputationTime, 6332 NumberOfCodeBlocks, 5668 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 8616 ConstructedInterpolants, 0 QuantifiedInterpolants, 11458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 14022 ConjunctsInSsa, 421 ConjunctsInUnsatCore, 53 InterpolantComputations, 3 PerfectInterpolantSequences, 531682/606421 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 12:22:14,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-crafted/xor1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 fa90627ffc045ef90595d49d60ca0f6095b53b667a9d0f028eb93e7bf4c6c579 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 12:22:16,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:22:16,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:22:16,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:22:16,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:22:16,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:22:16,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:22:16,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:22:16,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:22:16,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:22:16,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:22:16,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:22:16,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:22:16,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:22:16,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:22:16,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:22:16,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:22:16,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:22:16,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:22:16,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:22:16,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:22:16,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:22:16,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:22:16,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:22:16,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:22:16,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:22:16,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:22:16,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:22:16,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:22:16,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:22:16,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:22:16,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:22:16,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:22:16,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:22:16,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:22:16,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:22:16,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:22:16,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:22:16,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:22:16,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:22:16,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:22:16,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 12:22:16,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:22:16,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:22:16,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:22:16,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:22:16,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:22:16,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:22:16,549 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:22:16,549 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:22:16,549 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:22:16,549 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:22:16,549 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:22:16,550 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:22:16,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:22:16,550 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:22:16,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:22:16,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:22:16,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:22:16,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:22:16,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:22:16,552 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 12:22:16,552 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 12:22:16,552 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 12:22:16,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:22:16,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:22:16,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:22:16,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:22:16,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:22:16,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 12:22:16,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:22:16,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:22:16,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:22:16,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:22:16,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:22:16,554 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 12:22:16,554 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:16,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:22:16,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:22:16,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 12:22:16,555 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> fa90627ffc045ef90595d49d60ca0f6095b53b667a9d0f028eb93e7bf4c6c579 [2022-12-14 12:22:16,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:22:16,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:22:16,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:22:16,813 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:22:16,813 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:22:16,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/array-crafted/xor1.i [2022-12-14 12:22:19,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:22:19,540 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:22:19,540 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/sv-benchmarks/c/array-crafted/xor1.i [2022-12-14 12:22:19,545 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data/218b7cdca/3c8dde5925f34aadb6859a634216acbf/FLAG10943b540 [2022-12-14 12:22:19,556 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/data/218b7cdca/3c8dde5925f34aadb6859a634216acbf [2022-12-14 12:22:19,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:22:19,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:22:19,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:22:19,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:22:19,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:22:19,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f18ca83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19, skipping insertion in model container [2022-12-14 12:22:19,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:22:19,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:22:19,730 WARN L237 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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/sv-benchmarks/c/array-crafted/xor1.i[1285,1298] [2022-12-14 12:22:19,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:22:19,745 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:22:19,767 WARN L237 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_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/sv-benchmarks/c/array-crafted/xor1.i[1285,1298] [2022-12-14 12:22:19,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:22:19,783 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:22:19,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19 WrapperNode [2022-12-14 12:22:19,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:22:19,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:22:19,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:22:19,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:22:19,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,818 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-12-14 12:22:19,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:22:19,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:22:19,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:22:19,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:22:19,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,851 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:22:19,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:22:19,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:22:19,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:22:19,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (1/1) ... [2022-12-14 12:22:19,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:22:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:19,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:22:19,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:22:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-12-14 12:22:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 12:22:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 12:22:19,968 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:22:19,970 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:22:20,106 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:22:20,110 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:22:20,111 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 12:22:20,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:22:20 BoogieIcfgContainer [2022-12-14 12:22:20,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:22:20,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:22:20,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:22:20,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:22:20,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:22:19" (1/3) ... [2022-12-14 12:22:20,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d56c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:22:20, skipping insertion in model container [2022-12-14 12:22:20,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:22:19" (2/3) ... [2022-12-14 12:22:20,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d56c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:22:20, skipping insertion in model container [2022-12-14 12:22:20,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:22:20" (3/3) ... [2022-12-14 12:22:20,118 INFO L112 eAbstractionObserver]: Analyzing ICFG xor1.i [2022-12-14 12:22:20,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:22:20,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 12:22:20,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:22:20,177 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@22c4d75c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:22:20,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 12:22:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 12:22:20,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:20,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:20,187 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash -141219973, now seen corresponding path program 1 times [2022-12-14 12:22:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:20,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250373838] [2022-12-14 12:22:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:20,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:20,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:20,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:20,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 12:22:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:20,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:22:20,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:22:20,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:22:20,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:20,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250373838] [2022-12-14 12:22:20,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250373838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:22:20,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:22:20,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:22:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081013322] [2022-12-14 12:22:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:22:20,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:22:20,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:22:20,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:22:20,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:22:20,396 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:22:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:20,423 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-12-14 12:22:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:22:20,426 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-12-14 12:22:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:20,430 INFO L225 Difference]: With dead ends: 50 [2022-12-14 12:22:20,430 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 12:22:20,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:22:20,434 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:20,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:22:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 12:22:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-12-14 12:22:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-12-14 12:22:20,462 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 28 [2022-12-14 12:22:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:20,462 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-12-14 12:22:20,462 INFO L496 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:22:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-12-14 12:22:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 12:22:20,464 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:20,464 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:20,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:22:20,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:20,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash -618478211, now seen corresponding path program 1 times [2022-12-14 12:22:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:20,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82407230] [2022-12-14 12:22:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:20,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:20,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:20,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 12:22:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:20,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:20,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:22:20,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:22:20,880 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:20,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82407230] [2022-12-14 12:22:20,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82407230] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:20,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268016570] [2022-12-14 12:22:20,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:20,881 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:20,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:22:20,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:22:20,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-12-14 12:22:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:20,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:20,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:22:20,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:22:21,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [268016570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:21,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819855360] [2022-12-14 12:22:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:21,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:22:21,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:22:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:21,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:22:21,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 12:22:21,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:22:21,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819855360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:22:21,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-12-14 12:22:21,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4, 4] total 7 [2022-12-14 12:22:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582715466] [2022-12-14 12:22:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:22:21,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:22:21,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:22:21,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:22:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:22:21,084 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:22:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:21,099 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-12-14 12:22:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:22:21,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-12-14 12:22:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:21,101 INFO L225 Difference]: With dead ends: 42 [2022-12-14 12:22:21,101 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 12:22:21,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:22:21,102 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:21,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:22:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 12:22:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-12-14 12:22:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-12-14 12:22:21,108 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2022-12-14 12:22:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:21,108 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-12-14 12:22:21,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:22:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-12-14 12:22:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 12:22:21,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:21,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:21,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 12:22:21,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:22:21,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2022-12-14 12:22:21,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:21,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1511029509, now seen corresponding path program 1 times [2022-12-14 12:22:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:21,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788573675] [2022-12-14 12:22:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:21,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:21,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:21,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:21,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 12:22:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:21,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:21,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 12:22:21,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 12:22:21,843 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:21,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788573675] [2022-12-14 12:22:21,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788573675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:21,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [156842818] [2022-12-14 12:22:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:22:21,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:22:21,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-12-14 12:22:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:21,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:21,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 12:22:21,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 12:22:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [156842818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:21,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886936232] [2022-12-14 12:22:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:21,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:21,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:21,985 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:22:21,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:22:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:22,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:22:22,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 12:22:22,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:22:22,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886936232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:22:22,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-12-14 12:22:22,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4, 4] total 7 [2022-12-14 12:22:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252133194] [2022-12-14 12:22:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:22:22,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:22:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:22:22,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:22:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:22:22,058 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:22:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:22,072 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-12-14 12:22:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:22:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-12-14 12:22:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:22,074 INFO L225 Difference]: With dead ends: 39 [2022-12-14 12:22:22,074 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 12:22:22,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:22:22,075 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:22,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:22:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 12:22:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-12-14 12:22:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-12-14 12:22:22,078 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 36 [2022-12-14 12:22:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:22,079 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-12-14 12:22:22,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:22:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-12-14 12:22:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 12:22:22,080 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:22,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:22,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:22:22,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 12:22:22,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-12-14 12:22:22,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:22,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1553738215, now seen corresponding path program 1 times [2022-12-14 12:22:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272705667] [2022-12-14 12:22:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:22,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:22,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 12:22:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:22,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:22,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:22:22,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:22:22,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272705667] [2022-12-14 12:22:22,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272705667] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [666320513] [2022-12-14 12:22:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:22,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:22:22,792 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:22:22,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-12-14 12:22:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:22,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:22,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:22:22,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:22:22,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [666320513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045979773] [2022-12-14 12:22:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:22:22,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:22,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:22:22,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 12:22:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:22:22,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:22,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 12:22:23,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:22:23,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045979773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:23,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 12:22:23,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 10 [2022-12-14 12:22:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418039074] [2022-12-14 12:22:23,029 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 12:22:23,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 12:22:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:22:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 12:22:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:22:23,031 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:22:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:23,142 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-12-14 12:22:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 12:22:23,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 38 [2022-12-14 12:22:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:23,143 INFO L225 Difference]: With dead ends: 57 [2022-12-14 12:22:23,143 INFO L226 Difference]: Without dead ends: 37 [2022-12-14 12:22:23,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:22:23,144 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:23,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:22:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-14 12:22:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-12-14 12:22:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-12-14 12:22:23,148 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 38 [2022-12-14 12:22:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:23,148 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-12-14 12:22:23,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:22:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-12-14 12:22:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 12:22:23,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:23,149 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:23,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-12-14 12:22:23,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-12-14 12:22:23,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 12:22:23,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:23,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:23,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:23,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1298280697, now seen corresponding path program 2 times [2022-12-14 12:22:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:23,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107813526] [2022-12-14 12:22:23,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 12:22:23,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:23,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:23,759 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:23,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 12:22:23,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 12:22:23,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:23,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:22:23,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 12:22:23,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 12:22:23,981 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107813526] [2022-12-14 12:22:23,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107813526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1903730629] [2022-12-14 12:22:23,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 12:22:23,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:23,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:22:23,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:22:23,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-12-14 12:22:24,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 12:22:24,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:24,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:22:24,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 12:22:24,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 12:22:24,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1903730629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:24,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790028813] [2022-12-14 12:22:24,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 12:22:24,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:24,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:24,150 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:22:24,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 12:22:24,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 12:22:24,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:24,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:22:24,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 12:22:24,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 12:22:24,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790028813] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:24,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 12:22:24,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 4, 4] total 16 [2022-12-14 12:22:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754796495] [2022-12-14 12:22:24,291 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 12:22:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 12:22:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:22:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 12:22:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-14 12:22:24,293 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 12:22:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:24,540 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-12-14 12:22:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 12:22:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 50 [2022-12-14 12:22:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:24,541 INFO L225 Difference]: With dead ends: 81 [2022-12-14 12:22:24,541 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 12:22:24,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-12-14 12:22:24,542 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:24,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 162 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:22:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 12:22:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-14 12:22:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-12-14 12:22:24,548 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 50 [2022-12-14 12:22:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:24,548 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-12-14 12:22:24,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 12:22:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-12-14 12:22:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 12:22:24,549 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:24,549 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:24,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2022-12-14 12:22:24,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 12:22:24,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 12:22:25,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:25,152 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1940012673, now seen corresponding path program 3 times [2022-12-14 12:22:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:25,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953626515] [2022-12-14 12:22:25,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:22:25,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:25,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:25,155 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:25,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-14 12:22:25,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 12:22:25,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:25,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:22:25,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 88 proven. 16 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-12-14 12:22:25,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 88 proven. 16 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-12-14 12:22:25,384 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:25,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953626515] [2022-12-14 12:22:25,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953626515] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:25,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [676834014] [2022-12-14 12:22:25,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:22:25,385 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:25,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:22:25,386 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:22:25,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-12-14 12:22:25,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 12:22:25,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:25,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 12:22:25,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 88 proven. 16 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-12-14 12:22:25,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 88 proven. 16 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-12-14 12:22:25,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [676834014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538673896] [2022-12-14 12:22:25,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:22:25,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:25,618 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:22:25,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 12:22:25,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 12:22:25,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:25,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 12:22:25,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 88 proven. 16 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-12-14 12:22:25,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 88 proven. 16 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-12-14 12:22:25,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538673896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:25,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 12:22:25,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 8] total 16 [2022-12-14 12:22:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981443479] [2022-12-14 12:22:25,991 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 12:22:25,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 12:22:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:22:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 12:22:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-12-14 12:22:25,994 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:22:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:26,261 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2022-12-14 12:22:26,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 12:22:26,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 80 [2022-12-14 12:22:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:26,263 INFO L225 Difference]: With dead ends: 98 [2022-12-14 12:22:26,263 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 12:22:26,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2022-12-14 12:22:26,264 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:26,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 176 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:22:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 12:22:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-14 12:22:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-12-14 12:22:26,269 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 80 [2022-12-14 12:22:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:26,269 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-12-14 12:22:26,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:22:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-12-14 12:22:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 12:22:26,270 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:26,271 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:26,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-12-14 12:22:26,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2022-12-14 12:22:26,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 12:22:26,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:26,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash -690963469, now seen corresponding path program 4 times [2022-12-14 12:22:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:26,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814724001] [2022-12-14 12:22:26,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:22:26,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:26,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:26,878 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:26,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-12-14 12:22:27,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:22:27,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:27,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 12:22:27,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2022-12-14 12:22:27,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2022-12-14 12:22:27,439 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:27,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814724001] [2022-12-14 12:22:27,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814724001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:27,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [672350520] [2022-12-14 12:22:27,439 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:22:27,440 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:27,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:22:27,443 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:22:27,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-12-14 12:22:27,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:22:27,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:27,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 12:22:27,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2022-12-14 12:22:27,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2022-12-14 12:22:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [672350520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799897053] [2022-12-14 12:22:27,771 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:22:27,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:22:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:22:27,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:22:27,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 12:22:27,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:22:27,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:27,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 12:22:27,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2022-12-14 12:22:28,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2022-12-14 12:22:29,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799897053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:29,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 12:22:29,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 14] total 47 [2022-12-14 12:22:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062688231] [2022-12-14 12:22:29,056 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 12:22:29,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 12:22:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 12:22:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 12:22:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 12:22:29,057 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 47 states, 47 states have (on average 2.425531914893617) internal successors, (114), 47 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 12:22:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:22:33,238 INFO L93 Difference]: Finished difference Result 159 states and 193 transitions. [2022-12-14 12:22:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 12:22:33,239 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.425531914893617) internal successors, (114), 47 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2022-12-14 12:22:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:22:33,240 INFO L225 Difference]: With dead ends: 159 [2022-12-14 12:22:33,240 INFO L226 Difference]: Without dead ends: 115 [2022-12-14 12:22:33,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=859, Invalid=3697, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 12:22:33,243 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:22:33,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 596 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 12:22:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-14 12:22:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-12-14 12:22:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 110 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 12:22:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2022-12-14 12:22:33,255 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 116 [2022-12-14 12:22:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:22:33,255 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2022-12-14 12:22:33,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.425531914893617) internal successors, (114), 47 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 12:22:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-12-14 12:22:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-12-14 12:22:33,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:22:33,259 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 22, 22, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:22:33,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 12:22:33,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-12-14 12:22:33,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-12-14 12:22:33,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:33,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 12:22:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:22:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2103912947, now seen corresponding path program 5 times [2022-12-14 12:22:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 12:22:33,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077106477] [2022-12-14 12:22:33,864 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 12:22:33,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 12:22:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 12:22:33,866 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 12:22:33,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-14 12:22:35,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2022-12-14 12:22:35,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:22:35,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 12:22:35,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:22:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5003 backedges. 2028 proven. 484 refuted. 0 times theorem prover too weak. 2491 trivial. 0 not checked. [2022-12-14 12:22:35,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:22:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5003 backedges. 0 proven. 2516 refuted. 0 times theorem prover too weak. 2487 trivial. 0 not checked. [2022-12-14 12:22:37,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 12:22:37,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077106477] [2022-12-14 12:22:37,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077106477] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:22:37,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2070250096] [2022-12-14 12:22:37,935 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 12:22:37,935 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 12:22:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 12:22:37,936 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 12:22:37,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b099087-ec4f-4fa1-b8ad-c865bc0b519a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process