./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/Dubois-017.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/Dubois-017.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 17:42:01,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 17:42:01,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 17:42:01,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 17:42:01,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 17:42:01,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 17:42:01,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 17:42:01,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 17:42:01,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 17:42:01,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 17:42:01,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 17:42:01,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 17:42:01,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 17:42:01,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 17:42:01,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 17:42:01,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 17:42:01,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 17:42:01,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 17:42:01,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 17:42:01,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 17:42:01,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 17:42:01,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 17:42:01,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 17:42:01,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 17:42:01,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 17:42:01,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 17:42:01,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 17:42:01,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 17:42:01,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 17:42:01,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 17:42:01,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 17:42:01,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 17:42:01,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 17:42:01,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 17:42:01,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 17:42:01,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 17:42:01,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 17:42:01,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 17:42:01,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 17:42:01,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 17:42:01,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 17:42:01,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 17:42:01,209 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 17:42:01,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 17:42:01,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 17:42:01,210 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 17:42:01,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 17:42:01,210 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 17:42:01,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 17:42:01,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 17:42:01,211 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 17:42:01,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 17:42:01,211 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 17:42:01,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 17:42:01,212 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 17:42:01,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 17:42:01,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 17:42:01,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 17:42:01,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 17:42:01,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 17:42:01,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 17:42:01,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 17:42:01,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 17:42:01,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 17:42:01,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 17:42:01,214 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 17:42:01,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 17:42:01,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 17:42:01,214 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 17:42:01,215 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 [2021-12-17 17:42:01,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 17:42:01,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 17:42:01,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 17:42:01,390 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 17:42:01,393 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 17:42:01,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/Dubois-017.c [2021-12-17 17:42:01,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1f1945ec/2ab9352748204547a617e82f228a2909/FLAGf0ee7a68b [2021-12-17 17:42:01,863 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 17:42:01,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-017.c [2021-12-17 17:42:01,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1f1945ec/2ab9352748204547a617e82f228a2909/FLAGf0ee7a68b [2021-12-17 17:42:01,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1f1945ec/2ab9352748204547a617e82f228a2909 [2021-12-17 17:42:01,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 17:42:01,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 17:42:01,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 17:42:01,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 17:42:01,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 17:42:01,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:42:01" (1/1) ... [2021-12-17 17:42:01,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6412dee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:01, skipping insertion in model container [2021-12-17 17:42:01,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:42:01" (1/1) ... [2021-12-17 17:42:01,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 17:42:01,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 17:42:02,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-12-17 17:42:02,129 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 17:42:02,138 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 17:42:02,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-12-17 17:42:02,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 17:42:02,213 INFO L208 MainTranslator]: Completed translation [2021-12-17 17:42:02,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02 WrapperNode [2021-12-17 17:42:02,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 17:42:02,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 17:42:02,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 17:42:02,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 17:42:02,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,263 INFO L137 Inliner]: procedures = 13, calls = 143, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 357 [2021-12-17 17:42:02,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 17:42:02,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 17:42:02,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 17:42:02,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 17:42:02,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 17:42:02,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 17:42:02,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 17:42:02,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 17:42:02,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (1/1) ... [2021-12-17 17:42:02,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 17:42:02,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 17:42:02,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 17:42:02,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 17:42:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 17:42:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 17:42:02,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 17:42:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 17:42:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-17 17:42:02,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-17 17:42:02,470 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 17:42:02,472 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 17:42:02,740 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 17:42:02,761 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 17:42:02,762 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 17:42:02,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:42:02 BoogieIcfgContainer [2021-12-17 17:42:02,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 17:42:02,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 17:42:02,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 17:42:02,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 17:42:02,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 05:42:01" (1/3) ... [2021-12-17 17:42:02,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56381f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:42:02, skipping insertion in model container [2021-12-17 17:42:02,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:02" (2/3) ... [2021-12-17 17:42:02,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56381f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:42:02, skipping insertion in model container [2021-12-17 17:42:02,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:42:02" (3/3) ... [2021-12-17 17:42:02,770 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-017.c [2021-12-17 17:42:02,773 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 17:42:02,774 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 17:42:02,806 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 17:42:02,810 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 17:42:02,810 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 17:42:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-12-17 17:42:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-12-17 17:42:02,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:42:02,884 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 17:42:02,885 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:42:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:42:02,892 INFO L85 PathProgramCache]: Analyzing trace with hash 614162225, now seen corresponding path program 1 times [2021-12-17 17:42:02,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 17:42:02,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125662983] [2021-12-17 17:42:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:42:02,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 17:42:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 17:42:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 17:42:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 17:42:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 17:42:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-17 17:42:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-17 17:42:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-17 17:42:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-17 17:42:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-17 17:42:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-17 17:42:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-17 17:42:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-17 17:42:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-17 17:42:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 17:42:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-17 17:42:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 17:42:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 17:42:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 17:42:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 17:42:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-17 17:42:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-17 17:42:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 17:42:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-17 17:42:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-17 17:42:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-17 17:42:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-17 17:42:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 17:42:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 17:42:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 17:42:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-17 17:42:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-17 17:42:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-17 17:42:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-17 17:42:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-17 17:42:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-17 17:42:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-17 17:42:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-17 17:42:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-12-17 17:42:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-17 17:42:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-17 17:42:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-12-17 17:42:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-17 17:42:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2021-12-17 17:42:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-17 17:42:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-17 17:42:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-17 17:42:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-17 17:42:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-17 17:42:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-17 17:42:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-17 17:42:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-17 17:42:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-17 17:42:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-17 17:42:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-17 17:42:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-17 17:42:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-17 17:42:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-17 17:42:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-17 17:42:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-17 17:42:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-17 17:42:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-17 17:42:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-17 17:42:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-17 17:42:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-17 17:42:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-17 17:42:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-17 17:42:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-17 17:42:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-17 17:42:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-17 17:42:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2021-12-17 17:42:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-17 17:42:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2021-12-17 17:42:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2021-12-17 17:42:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-12-17 17:42:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2021-12-17 17:42:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-17 17:42:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2021-12-17 17:42:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2021-12-17 17:42:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2021-12-17 17:42:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2021-12-17 17:42:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-12-17 17:42:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2021-12-17 17:42:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2021-12-17 17:42:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2021-12-17 17:42:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2021-12-17 17:42:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2021-12-17 17:42:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2021-12-17 17:42:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2021-12-17 17:42:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2021-12-17 17:42:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2021-12-17 17:42:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2021-12-17 17:42:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2021-12-17 17:42:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2021-12-17 17:42:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-12-17 17:42:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2021-12-17 17:42:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2021-12-17 17:42:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2021-12-17 17:42:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2021-12-17 17:42:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2021-12-17 17:42:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2021-12-17 17:42:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2021-12-17 17:42:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2021-12-17 17:42:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2021-12-17 17:42:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2021-12-17 17:42:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 573 [2021-12-17 17:42:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 578 [2021-12-17 17:42:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 583 [2021-12-17 17:42:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2021-12-17 17:42:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 593 [2021-12-17 17:42:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2021-12-17 17:42:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2021-12-17 17:42:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 608 [2021-12-17 17:42:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 613 [2021-12-17 17:42:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2021-12-17 17:42:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2021-12-17 17:42:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2021-12-17 17:42:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2021-12-17 17:42:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 638 [2021-12-17 17:42:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 643 [2021-12-17 17:42:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 648 [2021-12-17 17:42:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653 [2021-12-17 17:42:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2021-12-17 17:42:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 663 [2021-12-17 17:42:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 668 [2021-12-17 17:42:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 673 [2021-12-17 17:42:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 678 [2021-12-17 17:42:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2021-12-17 17:42:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2021-12-17 17:42:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 693 [2021-12-17 17:42:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 698 [2021-12-17 17:42:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 703 [2021-12-17 17:42:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 708 [2021-12-17 17:42:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2021-12-17 17:42:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2021-12-17 17:42:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2021-12-17 17:42:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2021-12-17 17:42:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36720 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36720 trivial. 0 not checked. [2021-12-17 17:42:03,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 17:42:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125662983] [2021-12-17 17:42:03,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125662983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 17:42:03,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 17:42:03,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 17:42:03,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062817780] [2021-12-17 17:42:03,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 17:42:03,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 17:42:03,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 17:42:03,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 17:42:03,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 17:42:03,835 INFO L87 Difference]: Start difference. First operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 1 states have call predecessors, (136), 2 states have call successors, (136) [2021-12-17 17:42:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 17:42:03,901 INFO L93 Difference]: Finished difference Result 390 states and 796 transitions. [2021-12-17 17:42:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 17:42:03,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 1 states have call predecessors, (136), 2 states have call successors, (136) Word has length 734 [2021-12-17 17:42:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 17:42:03,913 INFO L225 Difference]: With dead ends: 390 [2021-12-17 17:42:03,913 INFO L226 Difference]: Without dead ends: 195 [2021-12-17 17:42:03,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 17:42:03,920 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 17:42:03,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 17:42:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-17 17:42:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-12-17 17:42:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 57 states have (on average 1.0) internal successors, (57), 57 states have internal predecessors, (57), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-12-17 17:42:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 329 transitions. [2021-12-17 17:42:03,981 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 329 transitions. Word has length 734 [2021-12-17 17:42:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 17:42:03,982 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 329 transitions. [2021-12-17 17:42:03,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 1 states have call predecessors, (136), 2 states have call successors, (136) [2021-12-17 17:42:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 329 transitions. [2021-12-17 17:42:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-12-17 17:42:03,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:42:03,996 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 17:42:03,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 17:42:03,996 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:42:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:42:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1555864369, now seen corresponding path program 1 times [2021-12-17 17:42:03,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 17:42:03,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320788396] [2021-12-17 17:42:03,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:42:03,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 17:42:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 17:42:04,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 17:42:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 17:42:04,486 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 17:42:04,486 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 17:42:04,487 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 17:42:04,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 17:42:04,490 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 17:42:04,493 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 17:42:04,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 05:42:04 BoogieIcfgContainer [2021-12-17 17:42:04,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 17:42:04,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 17:42:04,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 17:42:04,632 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 17:42:04,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:42:02" (3/4) ... [2021-12-17 17:42:04,635 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 17:42:04,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 17:42:04,635 INFO L158 Benchmark]: Toolchain (without parser) took 2755.18ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 76.5MB in the beginning and 56.7MB in the end (delta: 19.8MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2021-12-17 17:42:04,636 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 17:42:04,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.64ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 72.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 17:42:04,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.72ms. Allocated memory is still 111.1MB. Free memory was 72.7MB in the beginning and 67.9MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 17:42:04,640 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 111.1MB. Free memory was 67.9MB in the beginning and 64.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 17:42:04,640 INFO L158 Benchmark]: RCFGBuilder took 465.87ms. Allocated memory is still 111.1MB. Free memory was 64.8MB in the beginning and 45.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-17 17:42:04,641 INFO L158 Benchmark]: TraceAbstraction took 1866.90ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 44.8MB in the beginning and 56.7MB in the end (delta: -11.9MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2021-12-17 17:42:04,641 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 148.9MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 17:42:04,645 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.17ms. Allocated memory is still 79.7MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.64ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 72.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.72ms. Allocated memory is still 111.1MB. Free memory was 72.7MB in the beginning and 67.9MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 111.1MB. Free memory was 67.9MB in the beginning and 64.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.87ms. Allocated memory is still 111.1MB. Free memory was 64.8MB in the beginning and 45.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1866.90ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 44.8MB in the beginning and 56.7MB in the end (delta: -11.9MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 148.9MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 366]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 362. Possible FailurePath: [L22] int cond0; [L23] int dummy = 0; [L24] int N; [L25] int var0; [L26] var0 = __VERIFIER_nondet_int() [L27] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L27] RET assume(var0 >= 0) VAL [dummy=0, var0=1] [L28] CALL assume(var0 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume(var0 <= 1) VAL [dummy=0, var0=1] [L29] int var1; [L30] var1 = __VERIFIER_nondet_int() [L31] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume(var1 >= 0) VAL [dummy=0, var0=1, var1=1] [L32] CALL assume(var1 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L32] RET assume(var1 <= 1) VAL [dummy=0, var0=1, var1=1] [L33] int var2; [L34] var2 = __VERIFIER_nondet_int() [L35] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L35] RET assume(var2 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1] [L36] CALL assume(var2 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L36] RET assume(var2 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1] [L37] int var3; [L38] var3 = __VERIFIER_nondet_int() [L39] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L39] RET assume(var3 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1] [L40] CALL assume(var3 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume(var3 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1] [L41] int var4; [L42] var4 = __VERIFIER_nondet_int() [L43] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L43] RET assume(var4 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1] [L44] CALL assume(var4 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L44] RET assume(var4 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1] [L45] int var5; [L46] var5 = __VERIFIER_nondet_int() [L47] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L47] RET assume(var5 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1] [L48] CALL assume(var5 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L48] RET assume(var5 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1] [L49] int var6; [L50] var6 = __VERIFIER_nondet_int() [L51] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L51] RET assume(var6 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1] [L52] CALL assume(var6 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L52] RET assume(var6 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1] [L53] int var7; [L54] var7 = __VERIFIER_nondet_int() [L55] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L55] RET assume(var7 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0] [L56] CALL assume(var7 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume(var7 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0] [L57] int var8; [L58] var8 = __VERIFIER_nondet_int() [L59] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L59] RET assume(var8 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0] [L60] CALL assume(var8 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L60] RET assume(var8 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0] [L61] int var9; [L62] var9 = __VERIFIER_nondet_int() [L63] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L63] RET assume(var9 >= 0) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L64] CALL assume(var9 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var9 <= 1) VAL [dummy=0, var0=1, var1=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L65] int var10; [L66] var10 = __VERIFIER_nondet_int() [L67] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var10 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L68] CALL assume(var10 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var10 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L69] int var11; [L70] var11 = __VERIFIER_nondet_int() [L71] CALL assume(var11 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var11 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L72] CALL assume(var11 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var11 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L73] int var12; [L74] var12 = __VERIFIER_nondet_int() [L75] CALL assume(var12 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var12 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L76] CALL assume(var12 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var12 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L77] int var13; [L78] var13 = __VERIFIER_nondet_int() [L79] CALL assume(var13 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var13 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L80] CALL assume(var13 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var13 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L81] int var14; [L82] var14 = __VERIFIER_nondet_int() [L83] CALL assume(var14 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var14 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L84] CALL assume(var14 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var14 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L85] int var15; [L86] var15 = __VERIFIER_nondet_int() [L87] CALL assume(var15 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var15 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L88] CALL assume(var15 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var15 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L89] int var16; [L90] var16 = __VERIFIER_nondet_int() [L91] CALL assume(var16 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var16 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L92] CALL assume(var16 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var16 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L93] int var17; [L94] var17 = __VERIFIER_nondet_int() [L95] CALL assume(var17 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var17 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L96] CALL assume(var17 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var17 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L97] int var18; [L98] var18 = __VERIFIER_nondet_int() [L99] CALL assume(var18 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var18 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L100] CALL assume(var18 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var18 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L101] int var19; [L102] var19 = __VERIFIER_nondet_int() [L103] CALL assume(var19 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var19 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L104] CALL assume(var19 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var19 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L105] int var20; [L106] var20 = __VERIFIER_nondet_int() [L107] CALL assume(var20 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var20 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L108] CALL assume(var20 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var20 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L109] int var21; [L110] var21 = __VERIFIER_nondet_int() [L111] CALL assume(var21 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var21 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L112] CALL assume(var21 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var21 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L113] int var22; [L114] var22 = __VERIFIER_nondet_int() [L115] CALL assume(var22 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var22 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L116] CALL assume(var22 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var22 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L117] int var23; [L118] var23 = __VERIFIER_nondet_int() [L119] CALL assume(var23 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var23 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L120] CALL assume(var23 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var23 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L121] int var24; [L122] var24 = __VERIFIER_nondet_int() [L123] CALL assume(var24 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var24 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L124] CALL assume(var24 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var24 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L125] int var25; [L126] var25 = __VERIFIER_nondet_int() [L127] CALL assume(var25 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var25 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L128] CALL assume(var25 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var25 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L129] int var26; [L130] var26 = __VERIFIER_nondet_int() [L131] CALL assume(var26 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var26 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L132] CALL assume(var26 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var26 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L133] int var27; [L134] var27 = __VERIFIER_nondet_int() [L135] CALL assume(var27 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var27 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L136] CALL assume(var27 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var27 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L137] int var28; [L138] var28 = __VERIFIER_nondet_int() [L139] CALL assume(var28 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var28 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L140] CALL assume(var28 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var28 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L141] int var29; [L142] var29 = __VERIFIER_nondet_int() [L143] CALL assume(var29 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var29 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L144] CALL assume(var29 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var29 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L145] int var30; [L146] var30 = __VERIFIER_nondet_int() [L147] CALL assume(var30 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var30 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L148] CALL assume(var30 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var30 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L149] int var31; [L150] var31 = __VERIFIER_nondet_int() [L151] CALL assume(var31 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var31 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L152] CALL assume(var31 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var31 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L153] int var32; [L154] var32 = __VERIFIER_nondet_int() [L155] CALL assume(var32 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var32 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L156] CALL assume(var32 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var32 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L157] int var33; [L158] var33 = __VERIFIER_nondet_int() [L159] CALL assume(var33 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var33 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L160] CALL assume(var33 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var33 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L161] int var34; [L162] var34 = __VERIFIER_nondet_int() [L163] CALL assume(var34 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var34 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L164] CALL assume(var34 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var34 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L165] int var35; [L166] var35 = __VERIFIER_nondet_int() [L167] CALL assume(var35 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var35 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L168] CALL assume(var35 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var35 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L169] int var36; [L170] var36 = __VERIFIER_nondet_int() [L171] CALL assume(var36 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var36 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L172] CALL assume(var36 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var36 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L173] int var37; [L174] var37 = __VERIFIER_nondet_int() [L175] CALL assume(var37 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var37 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L176] CALL assume(var37 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var37 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L177] int var38; [L178] var38 = __VERIFIER_nondet_int() [L179] CALL assume(var38 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var38 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L180] CALL assume(var38 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var38 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L181] int var39; [L182] var39 = __VERIFIER_nondet_int() [L183] CALL assume(var39 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var39 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L184] CALL assume(var39 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var39 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L185] int var40; [L186] var40 = __VERIFIER_nondet_int() [L187] CALL assume(var40 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var40 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L188] CALL assume(var40 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var40 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L189] int var41; [L190] var41 = __VERIFIER_nondet_int() [L191] CALL assume(var41 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var41 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L192] CALL assume(var41 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var41 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L193] int var42; [L194] var42 = __VERIFIER_nondet_int() [L195] CALL assume(var42 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var42 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L196] CALL assume(var42 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var42 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L197] int var43; [L198] var43 = __VERIFIER_nondet_int() [L199] CALL assume(var43 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var43 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L200] CALL assume(var43 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var43 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L201] int var44; [L202] var44 = __VERIFIER_nondet_int() [L203] CALL assume(var44 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var44 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L204] CALL assume(var44 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var44 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L205] int var45; [L206] var45 = __VERIFIER_nondet_int() [L207] CALL assume(var45 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L207] RET assume(var45 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L208] CALL assume(var45 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L208] RET assume(var45 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L209] int var46; [L210] var46 = __VERIFIER_nondet_int() [L211] CALL assume(var46 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L211] RET assume(var46 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L212] CALL assume(var46 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L212] RET assume(var46 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var5=1, var6=1, var7=0, var8=0, var9=0] [L213] int var47; [L214] var47 = __VERIFIER_nondet_int() [L215] CALL assume(var47 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L215] RET assume(var47 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L216] CALL assume(var47 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L216] RET assume(var47 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L217] int var48; [L218] var48 = __VERIFIER_nondet_int() [L219] CALL assume(var48 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L219] RET assume(var48 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L220] CALL assume(var48 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L220] RET assume(var48 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L221] int var49; [L222] var49 = __VERIFIER_nondet_int() [L223] CALL assume(var49 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L223] RET assume(var49 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L224] CALL assume(var49 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L224] RET assume(var49 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var6=1, var7=0, var8=0, var9=0] [L225] int var50; [L226] var50 = __VERIFIER_nondet_int() [L227] CALL assume(var50 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L227] RET assume(var50 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L228] CALL assume(var50 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L228] RET assume(var50 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L229] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L230-L233] CALL assume((var32 == 0 & var33 == 0 & var0 == 1) | (var32 == 0 & var33 == 1 & var0 == 0) | (var32 == 1 & var33 == 0 & var0 == 0) | (var32 == 1 & var33 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=62, cond=62] [L230-L233] RET assume((var32 == 0 & var33 == 0 & var0 == 1) | (var32 == 0 & var33 == 1 & var0 == 0) | (var32 == 1 & var33 == 0 & var0 == 0) | (var32 == 1 & var33 == 1 & var0 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L234-L237] CALL assume((var1 == 0 & var35 == 0 & var2 == 1) | (var1 == 0 & var35 == 1 & var2 == 0) | (var1 == 1 & var35 == 0 & var2 == 0) | (var1 == 1 & var35 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=79, cond=79] [L234-L237] RET assume((var1 == 0 & var35 == 0 & var2 == 1) | (var1 == 0 & var35 == 1 & var2 == 0) | (var1 == 1 & var35 == 0 & var2 == 0) | (var1 == 1 & var35 == 1 & var2 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L238-L241] CALL assume((var2 == 0 & var36 == 0 & var3 == 1) | (var2 == 0 & var36 == 1 & var3 == 0) | (var2 == 1 & var36 == 0 & var3 == 0) | (var2 == 1 & var36 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=61, cond=61] [L238-L241] RET assume((var2 == 0 & var36 == 0 & var3 == 1) | (var2 == 0 & var36 == 1 & var3 == 0) | (var2 == 1 & var36 == 0 & var3 == 0) | (var2 == 1 & var36 == 1 & var3 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L242-L245] CALL assume((var3 == 0 & var37 == 0 & var4 == 1) | (var3 == 0 & var37 == 1 & var4 == 0) | (var3 == 1 & var37 == 0 & var4 == 0) | (var3 == 1 & var37 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=69, cond=69] [L242-L245] RET assume((var3 == 0 & var37 == 0 & var4 == 1) | (var3 == 0 & var37 == 1 & var4 == 0) | (var3 == 1 & var37 == 0 & var4 == 0) | (var3 == 1 & var37 == 1 & var4 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L246-L249] CALL assume((var4 == 0 & var38 == 0 & var5 == 1) | (var4 == 0 & var38 == 1 & var5 == 0) | (var4 == 1 & var38 == 0 & var5 == 0) | (var4 == 1 & var38 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=72, cond=72] [L246-L249] RET assume((var4 == 0 & var38 == 0 & var5 == 1) | (var4 == 0 & var38 == 1 & var5 == 0) | (var4 == 1 & var38 == 0 & var5 == 0) | (var4 == 1 & var38 == 1 & var5 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L250-L253] CALL assume((var5 == 0 & var39 == 0 & var6 == 1) | (var5 == 0 & var39 == 1 & var6 == 0) | (var5 == 1 & var39 == 0 & var6 == 0) | (var5 == 1 & var39 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=70, cond=70] [L250-L253] RET assume((var5 == 0 & var39 == 0 & var6 == 1) | (var5 == 0 & var39 == 1 & var6 == 0) | (var5 == 1 & var39 == 0 & var6 == 0) | (var5 == 1 & var39 == 1 & var6 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L254-L257] CALL assume((var6 == 0 & var40 == 0 & var7 == 1) | (var6 == 0 & var40 == 1 & var7 == 0) | (var6 == 1 & var40 == 0 & var7 == 0) | (var6 == 1 & var40 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=65, cond=65] [L254-L257] RET assume((var6 == 0 & var40 == 0 & var7 == 1) | (var6 == 0 & var40 == 1 & var7 == 0) | (var6 == 1 & var40 == 0 & var7 == 0) | (var6 == 1 & var40 == 1 & var7 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L258-L261] CALL assume((var7 == 0 & var41 == 0 & var8 == 1) | (var7 == 0 & var41 == 1 & var8 == 0) | (var7 == 1 & var41 == 0 & var8 == 0) | (var7 == 1 & var41 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=80, cond=80] [L258-L261] RET assume((var7 == 0 & var41 == 0 & var8 == 1) | (var7 == 0 & var41 == 1 & var8 == 0) | (var7 == 1 & var41 == 0 & var8 == 0) | (var7 == 1 & var41 == 1 & var8 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L262-L265] CALL assume((var8 == 0 & var42 == 0 & var9 == 1) | (var8 == 0 & var42 == 1 & var9 == 0) | (var8 == 1 & var42 == 0 & var9 == 0) | (var8 == 1 & var42 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=52, cond=52] [L262-L265] RET assume((var8 == 0 & var42 == 0 & var9 == 1) | (var8 == 0 & var42 == 1 & var9 == 0) | (var8 == 1 & var42 == 0 & var9 == 0) | (var8 == 1 & var42 == 1 & var9 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L266-L269] CALL assume((var9 == 0 & var43 == 0 & var10 == 1) | (var9 == 0 & var43 == 1 & var10 == 0) | (var9 == 1 & var43 == 0 & var10 == 0) | (var9 == 1 & var43 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=57, cond=57] [L266-L269] RET assume((var9 == 0 & var43 == 0 & var10 == 1) | (var9 == 0 & var43 == 1 & var10 == 0) | (var9 == 1 & var43 == 0 & var10 == 0) | (var9 == 1 & var43 == 1 & var10 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L270-L273] CALL assume((var10 == 0 & var44 == 0 & var11 == 1) | (var10 == 0 & var44 == 1 & var11 == 0) | (var10 == 1 & var44 == 0 & var11 == 0) | (var10 == 1 & var44 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=73, cond=73] [L270-L273] RET assume((var10 == 0 & var44 == 0 & var11 == 1) | (var10 == 0 & var44 == 1 & var11 == 0) | (var10 == 1 & var44 == 0 & var11 == 0) | (var10 == 1 & var44 == 1 & var11 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L274-L277] CALL assume((var11 == 0 & var45 == 0 & var12 == 1) | (var11 == 0 & var45 == 1 & var12 == 0) | (var11 == 1 & var45 == 0 & var12 == 0) | (var11 == 1 & var45 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=71, cond=71] [L274-L277] RET assume((var11 == 0 & var45 == 0 & var12 == 1) | (var11 == 0 & var45 == 1 & var12 == 0) | (var11 == 1 & var45 == 0 & var12 == 0) | (var11 == 1 & var45 == 1 & var12 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L278-L281] CALL assume((var12 == 0 & var46 == 0 & var13 == 1) | (var12 == 0 & var46 == 1 & var13 == 0) | (var12 == 1 & var46 == 0 & var13 == 0) | (var12 == 1 & var46 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=63, cond=63] [L278-L281] RET assume((var12 == 0 & var46 == 0 & var13 == 1) | (var12 == 0 & var46 == 1 & var13 == 0) | (var12 == 1 & var46 == 0 & var13 == 0) | (var12 == 1 & var46 == 1 & var13 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L282-L285] CALL assume((var13 == 0 & var47 == 0 & var14 == 1) | (var13 == 0 & var47 == 1 & var14 == 0) | (var13 == 1 & var47 == 0 & var14 == 0) | (var13 == 1 & var47 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=76, cond=76] [L282-L285] RET assume((var13 == 0 & var47 == 0 & var14 == 1) | (var13 == 0 & var47 == 1 & var14 == 0) | (var13 == 1 & var47 == 0 & var14 == 0) | (var13 == 1 & var47 == 1 & var14 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L286-L289] CALL assume((var14 == 0 & var48 == 0 & var15 == 1) | (var14 == 0 & var48 == 1 & var15 == 0) | (var14 == 1 & var48 == 0 & var15 == 0) | (var14 == 1 & var48 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=74, cond=74] [L286-L289] RET assume((var14 == 0 & var48 == 0 & var15 == 1) | (var14 == 0 & var48 == 1 & var15 == 0) | (var14 == 1 & var48 == 0 & var15 == 0) | (var14 == 1 & var48 == 1 & var15 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L290-L293] CALL assume((var0 == 0 & var34 == 0 & var1 == 1) | (var0 == 0 & var34 == 1 & var1 == 0) | (var0 == 1 & var34 == 0 & var1 == 0) | (var0 == 1 & var34 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=67, cond=67] [L290-L293] RET assume((var0 == 0 & var34 == 0 & var1 == 1) | (var0 == 0 & var34 == 1 & var1 == 0) | (var0 == 1 & var34 == 0 & var1 == 0) | (var0 == 1 & var34 == 1 & var1 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L294-L297] CALL assume((var16 == 0 & var49 == 0 & var50 == 1) | (var16 == 0 & var49 == 1 & var50 == 0) | (var16 == 1 & var49 == 0 & var50 == 0) | (var16 == 1 & var49 == 1 & var50 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=75, cond=75] [L294-L297] RET assume((var16 == 0 & var49 == 0 & var50 == 1) | (var16 == 0 & var49 == 1 & var50 == 0) | (var16 == 1 & var49 == 0 & var50 == 0) | (var16 == 1 & var49 == 1 & var50 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L298-L301] CALL assume((var15 == 0 & var49 == 0 & var50 == 1) | (var15 == 0 & var49 == 1 & var50 == 0) | (var15 == 1 & var49 == 0 & var50 == 0) | (var15 == 1 & var49 == 1 & var50 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=64, cond=64] [L298-L301] RET assume((var15 == 0 & var49 == 0 & var50 == 1) | (var15 == 0 & var49 == 1 & var50 == 0) | (var15 == 1 & var49 == 0 & var50 == 0) | (var15 == 1 & var49 == 1 & var50 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L302-L305] CALL assume((var18 == 0 & var47 == 0 & var17 == 1) | (var18 == 0 & var47 == 1 & var17 == 0) | (var18 == 1 & var47 == 0 & var17 == 0) | (var18 == 1 & var47 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=81, cond=81] [L302-L305] RET assume((var18 == 0 & var47 == 0 & var17 == 1) | (var18 == 0 & var47 == 1 & var17 == 0) | (var18 == 1 & var47 == 0 & var17 == 0) | (var18 == 1 & var47 == 1 & var17 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L306-L309] CALL assume((var19 == 0 & var46 == 0 & var18 == 1) | (var19 == 0 & var46 == 1 & var18 == 0) | (var19 == 1 & var46 == 0 & var18 == 0) | (var19 == 1 & var46 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=66, cond=66] [L306-L309] RET assume((var19 == 0 & var46 == 0 & var18 == 1) | (var19 == 0 & var46 == 1 & var18 == 0) | (var19 == 1 & var46 == 0 & var18 == 0) | (var19 == 1 & var46 == 1 & var18 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L310-L313] CALL assume((var20 == 0 & var45 == 0 & var19 == 1) | (var20 == 0 & var45 == 1 & var19 == 0) | (var20 == 1 & var45 == 0 & var19 == 0) | (var20 == 1 & var45 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=77, cond=77] [L310-L313] RET assume((var20 == 0 & var45 == 0 & var19 == 1) | (var20 == 0 & var45 == 1 & var19 == 0) | (var20 == 1 & var45 == 0 & var19 == 0) | (var20 == 1 & var45 == 1 & var19 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L314-L317] CALL assume((var21 == 0 & var44 == 0 & var20 == 1) | (var21 == 0 & var44 == 1 & var20 == 0) | (var21 == 1 & var44 == 0 & var20 == 0) | (var21 == 1 & var44 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=82, cond=82] [L314-L317] RET assume((var21 == 0 & var44 == 0 & var20 == 1) | (var21 == 0 & var44 == 1 & var20 == 0) | (var21 == 1 & var44 == 0 & var20 == 0) | (var21 == 1 & var44 == 1 & var20 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L318-L321] CALL assume((var22 == 0 & var43 == 0 & var21 == 1) | (var22 == 0 & var43 == 1 & var21 == 0) | (var22 == 1 & var43 == 0 & var21 == 0) | (var22 == 1 & var43 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=49, cond=49] [L318-L321] RET assume((var22 == 0 & var43 == 0 & var21 == 1) | (var22 == 0 & var43 == 1 & var21 == 0) | (var22 == 1 & var43 == 0 & var21 == 0) | (var22 == 1 & var43 == 1 & var21 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L322-L325] CALL assume((var23 == 0 & var42 == 0 & var22 == 1) | (var23 == 0 & var42 == 1 & var22 == 0) | (var23 == 1 & var42 == 0 & var22 == 0) | (var23 == 1 & var42 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=50, cond=50] [L322-L325] RET assume((var23 == 0 & var42 == 0 & var22 == 1) | (var23 == 0 & var42 == 1 & var22 == 0) | (var23 == 1 & var42 == 0 & var22 == 0) | (var23 == 1 & var42 == 1 & var22 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L326-L329] CALL assume((var24 == 0 & var41 == 0 & var23 == 1) | (var24 == 0 & var41 == 1 & var23 == 0) | (var24 == 1 & var41 == 0 & var23 == 0) | (var24 == 1 & var41 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=51, cond=51] [L326-L329] RET assume((var24 == 0 & var41 == 0 & var23 == 1) | (var24 == 0 & var41 == 1 & var23 == 0) | (var24 == 1 & var41 == 0 & var23 == 0) | (var24 == 1 & var41 == 1 & var23 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L330-L333] CALL assume((var25 == 0 & var40 == 0 & var24 == 1) | (var25 == 0 & var40 == 1 & var24 == 0) | (var25 == 1 & var40 == 0 & var24 == 0) | (var25 == 1 & var40 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=55, cond=55] [L330-L333] RET assume((var25 == 0 & var40 == 0 & var24 == 1) | (var25 == 0 & var40 == 1 & var24 == 0) | (var25 == 1 & var40 == 0 & var24 == 0) | (var25 == 1 & var40 == 1 & var24 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L334-L337] CALL assume((var26 == 0 & var39 == 0 & var25 == 1) | (var26 == 0 & var39 == 1 & var25 == 0) | (var26 == 1 & var39 == 0 & var25 == 0) | (var26 == 1 & var39 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=58, cond=58] [L334-L337] RET assume((var26 == 0 & var39 == 0 & var25 == 1) | (var26 == 0 & var39 == 1 & var25 == 0) | (var26 == 1 & var39 == 0 & var25 == 0) | (var26 == 1 & var39 == 1 & var25 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L338-L341] CALL assume((var27 == 0 & var38 == 0 & var26 == 1) | (var27 == 0 & var38 == 1 & var26 == 0) | (var27 == 1 & var38 == 0 & var26 == 0) | (var27 == 1 & var38 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=53, cond=53] [L338-L341] RET assume((var27 == 0 & var38 == 0 & var26 == 1) | (var27 == 0 & var38 == 1 & var26 == 0) | (var27 == 1 & var38 == 0 & var26 == 0) | (var27 == 1 & var38 == 1 & var26 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L342-L345] CALL assume((var28 == 0 & var37 == 0 & var27 == 1) | (var28 == 0 & var37 == 1 & var27 == 0) | (var28 == 1 & var37 == 0 & var27 == 0) | (var28 == 1 & var37 == 1 & var27 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=54, cond=54] [L342-L345] RET assume((var28 == 0 & var37 == 0 & var27 == 1) | (var28 == 0 & var37 == 1 & var27 == 0) | (var28 == 1 & var37 == 0 & var27 == 0) | (var28 == 1 & var37 == 1 & var27 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L346-L349] CALL assume((var29 == 0 & var36 == 0 & var28 == 1) | (var29 == 0 & var36 == 1 & var28 == 0) | (var29 == 1 & var36 == 0 & var28 == 0) | (var29 == 1 & var36 == 1 & var28 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=56, cond=56] [L346-L349] RET assume((var29 == 0 & var36 == 0 & var28 == 1) | (var29 == 0 & var36 == 1 & var28 == 0) | (var29 == 1 & var36 == 0 & var28 == 0) | (var29 == 1 & var36 == 1 & var28 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L350-L353] CALL assume((var30 == 0 & var35 == 0 & var29 == 1) | (var30 == 0 & var35 == 1 & var29 == 0) | (var30 == 1 & var35 == 0 & var29 == 0) | (var30 == 1 & var35 == 1 & var29 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=68, cond=68] [L350-L353] RET assume((var30 == 0 & var35 == 0 & var29 == 1) | (var30 == 0 & var35 == 1 & var29 == 0) | (var30 == 1 & var35 == 0 & var29 == 0) | (var30 == 1 & var35 == 1 & var29 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L354-L357] CALL assume((var31 == 0 & var34 == 0 & var30 == 1) | (var31 == 0 & var34 == 1 & var30 == 0) | (var31 == 1 & var34 == 0 & var30 == 0) | (var31 == 1 & var34 == 1 & var30 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=59, cond=59] [L354-L357] RET assume((var31 == 0 & var34 == 0 & var30 == 1) | (var31 == 0 & var34 == 1 & var30 == 0) | (var31 == 1 & var34 == 0 & var30 == 0) | (var31 == 1 & var34 == 1 & var30 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L358-L361] CALL assume((var17 == 0 & var48 == 0 & var16 == 1) | (var17 == 0 & var48 == 1 & var16 == 0) | (var17 == 1 & var48 == 0 & var16 == 0) | (var17 == 1 & var48 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=60, cond=60] [L358-L361] RET assume((var17 == 0 & var48 == 0 & var16 == 1) | (var17 == 0 & var48 == 1 & var16 == 0) | (var17 == 1 & var48 == 0 & var16 == 0) | (var17 == 1 & var48 == 1 & var16 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L362-L365] CALL assume((var32 == 0 & var33 == 0 & var31 == 0) | (var32 == 0 & var33 == 1 & var31 == 1) | (var32 == 1 & var33 == 0 & var31 == 1) | (var32 == 1 & var33 == 1 & var31 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=78, cond=78] [L362-L365] RET assume((var32 == 0 & var33 == 0 & var31 == 0) | (var32 == 0 & var33 == 1 & var31 == 1) | (var32 == 1 & var33 == 0 & var31 == 1) | (var32 == 1 & var33 == 1 & var31 == 0) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] [L366] reach_error() VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=0, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=0, var21=1, var22=0, var23=0, var24=1, var25=1, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=1, var33=0, var34=1, var35=1, var36=0, var37=1, var38=0, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var45=0, var46=1, var47=0, var48=0, var49=0, var5=1, var50=0, var6=1, var7=0, var8=0, var9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 136, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 329 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1468 NumberOfCodeBlocks, 1468 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 36720/36720 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 [2021-12-17 17:42:04,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/Dubois-017.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 17:42:06,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 17:42:06,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 17:42:06,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 17:42:06,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 17:42:06,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 17:42:06,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 17:42:06,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 17:42:06,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 17:42:06,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 17:42:06,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 17:42:06,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 17:42:06,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 17:42:06,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 17:42:06,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 17:42:06,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 17:42:06,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 17:42:06,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 17:42:06,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 17:42:06,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 17:42:06,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 17:42:06,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 17:42:06,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 17:42:06,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 17:42:06,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 17:42:06,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 17:42:06,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 17:42:06,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 17:42:06,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 17:42:06,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 17:42:06,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 17:42:06,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 17:42:06,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 17:42:06,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 17:42:06,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 17:42:06,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 17:42:06,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 17:42:06,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 17:42:06,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 17:42:06,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 17:42:06,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 17:42:06,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 17:42:06,516 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 17:42:06,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 17:42:06,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 17:42:06,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 17:42:06,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 17:42:06,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 17:42:06,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 17:42:06,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 17:42:06,520 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 17:42:06,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 17:42:06,520 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 17:42:06,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 17:42:06,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 17:42:06,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 17:42:06,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 17:42:06,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 17:42:06,521 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 17:42:06,522 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 17:42:06,522 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 17:42:06,522 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 17:42:06,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 17:42:06,522 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 17:42:06,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 17:42:06,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 17:42:06,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 17:42:06,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 17:42:06,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 17:42:06,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 17:42:06,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 17:42:06,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 17:42:06,524 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 17:42:06,524 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 17:42:06,524 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 17:42:06,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 17:42:06,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 17:42:06,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 17:42:06,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 17:42:06,525 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 [2021-12-17 17:42:06,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 17:42:06,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 17:42:06,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 17:42:06,833 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 17:42:06,833 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 17:42:06,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/Dubois-017.c [2021-12-17 17:42:06,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b923699e7/34e7a24e412b4d39a1d7fef403ad4b38/FLAG0c6153d2d [2021-12-17 17:42:07,247 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 17:42:07,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-017.c [2021-12-17 17:42:07,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b923699e7/34e7a24e412b4d39a1d7fef403ad4b38/FLAG0c6153d2d [2021-12-17 17:42:07,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b923699e7/34e7a24e412b4d39a1d7fef403ad4b38 [2021-12-17 17:42:07,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 17:42:07,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 17:42:07,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 17:42:07,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 17:42:07,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 17:42:07,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16810f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07, skipping insertion in model container [2021-12-17 17:42:07,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 17:42:07,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 17:42:07,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-12-17 17:42:07,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 17:42:07,579 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 17:42:07,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-12-17 17:42:07,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 17:42:07,686 INFO L208 MainTranslator]: Completed translation [2021-12-17 17:42:07,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07 WrapperNode [2021-12-17 17:42:07,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 17:42:07,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 17:42:07,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 17:42:07,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 17:42:07,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,756 INFO L137 Inliner]: procedures = 13, calls = 143, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 306 [2021-12-17 17:42:07,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 17:42:07,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 17:42:07,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 17:42:07,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 17:42:07,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 17:42:07,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 17:42:07,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 17:42:07,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 17:42:07,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (1/1) ... [2021-12-17 17:42:07,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 17:42:07,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 17:42:07,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 17:42:07,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 17:42:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 17:42:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 17:42:07,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 17:42:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 17:42:07,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-17 17:42:07,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-17 17:42:07,915 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 17:42:07,928 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 17:42:08,239 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 17:42:08,254 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 17:42:08,254 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 17:42:08,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:42:08 BoogieIcfgContainer [2021-12-17 17:42:08,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 17:42:08,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 17:42:08,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 17:42:08,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 17:42:08,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 05:42:07" (1/3) ... [2021-12-17 17:42:08,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbdb26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:42:08, skipping insertion in model container [2021-12-17 17:42:08,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:42:07" (2/3) ... [2021-12-17 17:42:08,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbdb26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:42:08, skipping insertion in model container [2021-12-17 17:42:08,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:42:08" (3/3) ... [2021-12-17 17:42:08,266 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-017.c [2021-12-17 17:42:08,269 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 17:42:08,269 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 17:42:08,309 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 17:42:08,315 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 17:42:08,315 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 17:42:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-12-17 17:42:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-12-17 17:42:08,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:42:08,364 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 17:42:08,365 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:42:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:42:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash 614162225, now seen corresponding path program 1 times [2021-12-17 17:42:08,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 17:42:08,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253272775] [2021-12-17 17:42:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:42:08,381 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 17:42:08,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 17:42:08,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 17:42:08,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 17:42:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:08,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 17:42:08,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 17:42:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 36720 backedges. 16814 proven. 0 refuted. 0 times theorem prover too weak. 19906 trivial. 0 not checked. [2021-12-17 17:42:09,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 17:42:09,582 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 17:42:09,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253272775] [2021-12-17 17:42:09,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253272775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 17:42:09,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 17:42:09,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 17:42:09,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660514561] [2021-12-17 17:42:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 17:42:09,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 17:42:09,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 17:42:09,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 17:42:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 17:42:09,607 INFO L87 Difference]: Start difference. First operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 2 states have call predecessors, (136), 2 states have call successors, (136) [2021-12-17 17:42:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 17:42:09,650 INFO L93 Difference]: Finished difference Result 390 states and 796 transitions. [2021-12-17 17:42:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 17:42:09,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 2 states have call predecessors, (136), 2 states have call successors, (136) Word has length 734 [2021-12-17 17:42:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 17:42:09,661 INFO L225 Difference]: With dead ends: 390 [2021-12-17 17:42:09,661 INFO L226 Difference]: Without dead ends: 195 [2021-12-17 17:42:09,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 17:42:09,677 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 17:42:09,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 17:42:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-17 17:42:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-12-17 17:42:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 57 states have (on average 1.0) internal successors, (57), 57 states have internal predecessors, (57), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-12-17 17:42:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 329 transitions. [2021-12-17 17:42:09,755 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 329 transitions. Word has length 734 [2021-12-17 17:42:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 17:42:09,757 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 329 transitions. [2021-12-17 17:42:09,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 2 states have call predecessors, (136), 2 states have call successors, (136) [2021-12-17 17:42:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 329 transitions. [2021-12-17 17:42:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-12-17 17:42:09,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 17:42:09,770 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 17:42:09,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 17:42:09,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 17:42:09,976 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 17:42:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 17:42:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1555864369, now seen corresponding path program 1 times [2021-12-17 17:42:09,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 17:42:09,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486440529] [2021-12-17 17:42:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 17:42:09,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 17:42:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 17:42:09,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 17:42:09,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 17:42:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 17:42:29,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 240 conjunts are in the unsatisfiable core [2021-12-17 17:42:29,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... Killed by 15